./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b 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_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 19:55:42,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:55:42,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:55:42,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:55:42,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:55:42,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:55:42,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:55:42,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:55:42,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:55:42,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:55:42,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:55:42,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:55:42,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:55:42,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:55:42,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:55:42,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:55:42,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:55:42,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:55:42,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:55:42,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:55:42,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:55:42,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:55:42,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:55:42,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:55:42,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:55:42,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:55:42,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:55:42,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:55:42,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:55:42,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:55:42,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:55:42,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:55:42,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:55:42,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:55:42,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:55:42,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:55:42,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:55:42,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:55:42,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:55:42,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:55:42,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:55:42,268 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 19:55:42,304 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:55:42,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:55:42,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:55:42,305 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:55:42,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:55:42,306 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:55:42,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:55:42,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:55:42,307 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:55:42,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:55:42,309 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:55:42,309 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 19:55:42,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:55:42,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:55:42,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:55:42,310 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 19:55:42,310 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 19:55:42,310 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 19:55:42,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:55:42,310 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 19:55:42,311 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:55:42,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:55:42,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:55:42,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:55:42,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:55:42,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:55:42,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:55:42,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:55:42,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:55:42,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:55:42,314 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_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae [2022-11-18 19:55:42,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:55:42,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:55:42,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:55:42,616 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:55:42,617 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:55:42,618 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2022-11-18 19:55:42,721 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/data/fd3321d0c/ad6843a80b5b485a909724f33fd3704e/FLAG8d0c4c5ba [2022-11-18 19:55:43,228 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:55:43,229 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2022-11-18 19:55:43,241 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/data/fd3321d0c/ad6843a80b5b485a909724f33fd3704e/FLAG8d0c4c5ba [2022-11-18 19:55:43,553 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/data/fd3321d0c/ad6843a80b5b485a909724f33fd3704e [2022-11-18 19:55:43,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:55:43,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:55:43,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:55:43,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:55:43,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:55:43,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:55:43" (1/1) ... [2022-11-18 19:55:43,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16162790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:43, skipping insertion in model container [2022-11-18 19:55:43,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:55:43" (1/1) ... [2022-11-18 19:55:43,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:55:43,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:55:43,936 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027] [2022-11-18 19:55:44,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:55:44,246 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:55:44,262 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027] [2022-11-18 19:55:44,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:55:44,387 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:55:44,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:44 WrapperNode [2022-11-18 19:55:44,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:55:44,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:55:44,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:55:44,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:55:44,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:44" (1/1) ... [2022-11-18 19:55:44,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:44" (1/1) ... [2022-11-18 19:55:44,477 INFO L138 Inliner]: procedures = 175, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2022-11-18 19:55:44,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:55:44,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:55:44,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:55:44,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:55:44,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:44" (1/1) ... [2022-11-18 19:55:44,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:44" (1/1) ... [2022-11-18 19:55:44,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:44" (1/1) ... [2022-11-18 19:55:44,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:44" (1/1) ... [2022-11-18 19:55:44,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:44" (1/1) ... [2022-11-18 19:55:44,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:44" (1/1) ... [2022-11-18 19:55:44,504 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:44" (1/1) ... [2022-11-18 19:55:44,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:44" (1/1) ... [2022-11-18 19:55:44,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:55:44,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:55:44,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:55:44,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:55:44,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:44" (1/1) ... [2022-11-18 19:55:44,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:55:44,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:44,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:55:44,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:55:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:55:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:55:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 19:55:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:55:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:55:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:55:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 19:55:44,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 19:55:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 19:55:44,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 19:55:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:55:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 19:55:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:55:44,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:55:44,616 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 19:55:44,852 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:55:44,855 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:55:45,357 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:55:46,049 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:55:46,049 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:55:46,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:55:46 BoogieIcfgContainer [2022-11-18 19:55:46,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:55:46,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:55:46,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:55:46,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:55:46,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:55:43" (1/3) ... [2022-11-18 19:55:46,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48df1eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:55:46, skipping insertion in model container [2022-11-18 19:55:46,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:44" (2/3) ... [2022-11-18 19:55:46,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48df1eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:55:46, skipping insertion in model container [2022-11-18 19:55:46,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:55:46" (3/3) ... [2022-11-18 19:55:46,063 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2022-11-18 19:55:46,083 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:55:46,083 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-11-18 19:55:46,083 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:55:46,221 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 19:55:46,273 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 19:55:46,292 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 146 transitions, 302 flow [2022-11-18 19:55:46,298 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 146 transitions, 302 flow [2022-11-18 19:55:46,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 146 transitions, 302 flow [2022-11-18 19:55:46,402 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-11-18 19:55:46,402 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:55:46,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 195 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-11-18 19:55:46,412 INFO L119 LiptonReduction]: Number of co-enabled transitions 3768 [2022-11-18 19:56:09,843 INFO L134 LiptonReduction]: Checked pairs total: 12400 [2022-11-18 19:56:09,844 INFO L136 LiptonReduction]: Total number of compositions: 142 [2022-11-18 19:56:09,853 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 60 places, 54 transitions, 118 flow [2022-11-18 19:56:10,027 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3178 states, 2072 states have (on average 4.337355212355212) internal successors, (8987), 3177 states have internal predecessors, (8987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:10,050 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:56:10,056 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;@126a93f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:56:10,057 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2022-11-18 19:56:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 3178 states, 2072 states have (on average 4.337355212355212) internal successors, (8987), 3177 states have internal predecessors, (8987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 19:56:10,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:10,070 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 19:56:10,071 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:10,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:10,077 INFO L85 PathProgramCache]: Analyzing trace with hash 915, now seen corresponding path program 1 times [2022-11-18 19:56:10,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:10,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702045626] [2022-11-18 19:56:10,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:10,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:10,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:10,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702045626] [2022-11-18 19:56:10,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702045626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:10,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:10,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 19:56:10,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868100627] [2022-11-18 19:56:10,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:10,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:56:10,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:10,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:56:10,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:56:10,245 INFO L87 Difference]: Start difference. First operand has 3178 states, 2072 states have (on average 4.337355212355212) internal successors, (8987), 3177 states have internal predecessors, (8987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:10,372 INFO L93 Difference]: Finished difference Result 770 states and 2021 transitions. [2022-11-18 19:56:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:56:10,375 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-18 19:56:10,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:10,394 INFO L225 Difference]: With dead ends: 770 [2022-11-18 19:56:10,394 INFO L226 Difference]: Without dead ends: 770 [2022-11-18 19:56:10,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:56:10,398 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:10,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:56:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-18 19:56:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-11-18 19:56:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 636 states have (on average 3.1776729559748427) internal successors, (2021), 769 states have internal predecessors, (2021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2021 transitions. [2022-11-18 19:56:10,478 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2021 transitions. Word has length 1 [2022-11-18 19:56:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:10,478 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 2021 transitions. [2022-11-18 19:56:10,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2021 transitions. [2022-11-18 19:56:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 19:56:10,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:10,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 19:56:10,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:56:10,480 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:10,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:10,481 INFO L85 PathProgramCache]: Analyzing trace with hash 904072, now seen corresponding path program 1 times [2022-11-18 19:56:10,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:10,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707615566] [2022-11-18 19:56:10,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:10,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:10,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:10,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707615566] [2022-11-18 19:56:10,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707615566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:10,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:10,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 19:56:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534653028] [2022-11-18 19:56:10,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:10,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:56:10,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:10,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:56:10,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:10,793 INFO L87 Difference]: Start difference. First operand 770 states and 2021 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:10,927 INFO L93 Difference]: Finished difference Result 545 states and 1298 transitions. [2022-11-18 19:56:10,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:56:10,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-18 19:56:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:10,943 INFO L225 Difference]: With dead ends: 545 [2022-11-18 19:56:10,944 INFO L226 Difference]: Without dead ends: 539 [2022-11-18 19:56:10,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:10,948 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:10,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:56:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-11-18 19:56:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 479. [2022-11-18 19:56:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 430 states have (on average 2.7906976744186047) internal successors, (1200), 478 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1200 transitions. [2022-11-18 19:56:10,993 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1200 transitions. Word has length 3 [2022-11-18 19:56:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:10,993 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 1200 transitions. [2022-11-18 19:56:10,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1200 transitions. [2022-11-18 19:56:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 19:56:10,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:10,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 19:56:10,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:56:10,995 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:10,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:10,996 INFO L85 PathProgramCache]: Analyzing trace with hash 904073, now seen corresponding path program 1 times [2022-11-18 19:56:10,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:10,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146709926] [2022-11-18 19:56:11,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:11,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:11,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:11,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146709926] [2022-11-18 19:56:11,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146709926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:11,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:11,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 19:56:11,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514299848] [2022-11-18 19:56:11,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:11,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:56:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:11,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:56:11,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:11,179 INFO L87 Difference]: Start difference. First operand 479 states and 1200 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:11,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:11,264 INFO L93 Difference]: Finished difference Result 301 states and 711 transitions. [2022-11-18 19:56:11,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:56:11,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-18 19:56:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:11,266 INFO L225 Difference]: With dead ends: 301 [2022-11-18 19:56:11,267 INFO L226 Difference]: Without dead ends: 295 [2022-11-18 19:56:11,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:11,268 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:11,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:56:11,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-18 19:56:11,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-11-18 19:56:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 277 states have (on average 2.5415162454873648) internal successors, (704), 294 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 704 transitions. [2022-11-18 19:56:11,280 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 704 transitions. Word has length 3 [2022-11-18 19:56:11,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:11,281 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 704 transitions. [2022-11-18 19:56:11,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 704 transitions. [2022-11-18 19:56:11,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 19:56:11,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:11,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:11,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:56:11,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:11,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1771479313, now seen corresponding path program 1 times [2022-11-18 19:56:11,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:11,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886999874] [2022-11-18 19:56:11,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:11,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:11,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:11,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886999874] [2022-11-18 19:56:11,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886999874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:11,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:11,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 19:56:11,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344432536] [2022-11-18 19:56:11,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:11,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:56:11,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:11,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:56:11,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:11,502 INFO L87 Difference]: Start difference. First operand 295 states and 704 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:11,604 INFO L93 Difference]: Finished difference Result 285 states and 676 transitions. [2022-11-18 19:56:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:56:11,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-18 19:56:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:11,607 INFO L225 Difference]: With dead ends: 285 [2022-11-18 19:56:11,607 INFO L226 Difference]: Without dead ends: 285 [2022-11-18 19:56:11,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:11,609 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:11,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:56:11,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-18 19:56:11,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-11-18 19:56:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 267 states have (on average 2.5318352059925093) internal successors, (676), 284 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 676 transitions. [2022-11-18 19:56:11,665 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 676 transitions. Word has length 7 [2022-11-18 19:56:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:11,667 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 676 transitions. [2022-11-18 19:56:11,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 676 transitions. [2022-11-18 19:56:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 19:56:11,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:11,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:11,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:56:11,670 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:11,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:11,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2111180924, now seen corresponding path program 1 times [2022-11-18 19:56:11,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:11,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631583986] [2022-11-18 19:56:11,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:11,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:12,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:12,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631583986] [2022-11-18 19:56:12,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631583986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:12,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:12,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:56:12,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216271809] [2022-11-18 19:56:12,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:12,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:56:12,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:12,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:56:12,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:56:12,449 INFO L87 Difference]: Start difference. First operand 285 states and 676 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:12,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:12,664 INFO L93 Difference]: Finished difference Result 318 states and 716 transitions. [2022-11-18 19:56:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:56:12,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-18 19:56:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:12,666 INFO L225 Difference]: With dead ends: 318 [2022-11-18 19:56:12,667 INFO L226 Difference]: Without dead ends: 318 [2022-11-18 19:56:12,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:56:12,668 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:12,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 7 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:56:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-11-18 19:56:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 255. [2022-11-18 19:56:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 239 states have (on average 2.518828451882845) internal successors, (602), 254 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 602 transitions. [2022-11-18 19:56:12,676 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 602 transitions. Word has length 8 [2022-11-18 19:56:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:12,677 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 602 transitions. [2022-11-18 19:56:12,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 602 transitions. [2022-11-18 19:56:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 19:56:12,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:12,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:12,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:56:12,679 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:12,679 INFO L85 PathProgramCache]: Analyzing trace with hash -918718717, now seen corresponding path program 1 times [2022-11-18 19:56:12,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:12,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429196536] [2022-11-18 19:56:12,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:12,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:12,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:12,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429196536] [2022-11-18 19:56:12,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429196536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:12,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:12,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 19:56:12,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458280006] [2022-11-18 19:56:12,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:12,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:56:12,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:12,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:56:12,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:12,964 INFO L87 Difference]: Start difference. First operand 255 states and 602 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:13,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:13,052 INFO L93 Difference]: Finished difference Result 254 states and 599 transitions. [2022-11-18 19:56:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:56:13,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-18 19:56:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:13,055 INFO L225 Difference]: With dead ends: 254 [2022-11-18 19:56:13,055 INFO L226 Difference]: Without dead ends: 254 [2022-11-18 19:56:13,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:13,058 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:13,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 8 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:56:13,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-18 19:56:13,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2022-11-18 19:56:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 238 states have (on average 2.5168067226890756) internal successors, (599), 253 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 599 transitions. [2022-11-18 19:56:13,072 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 599 transitions. Word has length 8 [2022-11-18 19:56:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:13,073 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 599 transitions. [2022-11-18 19:56:13,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 599 transitions. [2022-11-18 19:56:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 19:56:13,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:13,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:13,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:56:13,076 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1022096632, now seen corresponding path program 1 times [2022-11-18 19:56:13,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:13,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371336350] [2022-11-18 19:56:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:13,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:13,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:13,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371336350] [2022-11-18 19:56:13,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371336350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:13,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:13,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 19:56:13,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737079018] [2022-11-18 19:56:13,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:13,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:56:13,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:13,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:56:13,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:13,393 INFO L87 Difference]: Start difference. First operand 254 states and 599 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:13,475 INFO L93 Difference]: Finished difference Result 251 states and 591 transitions. [2022-11-18 19:56:13,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:56:13,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-18 19:56:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:13,478 INFO L225 Difference]: With dead ends: 251 [2022-11-18 19:56:13,478 INFO L226 Difference]: Without dead ends: 251 [2022-11-18 19:56:13,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:13,479 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:13,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:56:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-18 19:56:13,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-11-18 19:56:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 235 states have (on average 2.5148936170212766) internal successors, (591), 250 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 591 transitions. [2022-11-18 19:56:13,487 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 591 transitions. Word has length 9 [2022-11-18 19:56:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:13,488 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 591 transitions. [2022-11-18 19:56:13,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:13,488 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 591 transitions. [2022-11-18 19:56:13,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 19:56:13,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:13,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:13,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:56:13,490 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:13,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:13,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1584592030, now seen corresponding path program 1 times [2022-11-18 19:56:13,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:13,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563625233] [2022-11-18 19:56:13,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:13,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:13,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:13,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563625233] [2022-11-18 19:56:13,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563625233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:13,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:13,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:56:13,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462437877] [2022-11-18 19:56:13,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:13,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:56:13,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:13,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:56:13,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:56:13,764 INFO L87 Difference]: Start difference. First operand 251 states and 591 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:13,867 INFO L93 Difference]: Finished difference Result 247 states and 580 transitions. [2022-11-18 19:56:13,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:56:13,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-18 19:56:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:13,869 INFO L225 Difference]: With dead ends: 247 [2022-11-18 19:56:13,869 INFO L226 Difference]: Without dead ends: 247 [2022-11-18 19:56:13,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:56:13,870 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:13,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 11 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:56:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-18 19:56:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2022-11-18 19:56:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 231 states have (on average 2.5108225108225106) internal successors, (580), 246 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 580 transitions. [2022-11-18 19:56:13,879 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 580 transitions. Word has length 9 [2022-11-18 19:56:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:13,880 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 580 transitions. [2022-11-18 19:56:13,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 580 transitions. [2022-11-18 19:56:13,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 19:56:13,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:13,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:13,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:56:13,882 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:13,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:13,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1620325705, now seen corresponding path program 1 times [2022-11-18 19:56:13,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:13,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630068956] [2022-11-18 19:56:13,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:13,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:14,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:14,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630068956] [2022-11-18 19:56:14,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630068956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:14,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:14,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:56:14,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423959417] [2022-11-18 19:56:14,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:14,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:56:14,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:14,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:56:14,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:56:14,109 INFO L87 Difference]: Start difference. First operand 247 states and 580 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:14,250 INFO L93 Difference]: Finished difference Result 321 states and 734 transitions. [2022-11-18 19:56:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:56:14,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-18 19:56:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:14,255 INFO L225 Difference]: With dead ends: 321 [2022-11-18 19:56:14,255 INFO L226 Difference]: Without dead ends: 321 [2022-11-18 19:56:14,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:56:14,256 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:14,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 11 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:56:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-11-18 19:56:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 267. [2022-11-18 19:56:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 251 states have (on average 2.4820717131474104) internal successors, (623), 266 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 623 transitions. [2022-11-18 19:56:14,268 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 623 transitions. Word has length 10 [2022-11-18 19:56:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:14,269 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 623 transitions. [2022-11-18 19:56:14,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 623 transitions. [2022-11-18 19:56:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 19:56:14,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:14,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:14,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 19:56:14,276 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:14,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:14,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1874592415, now seen corresponding path program 1 times [2022-11-18 19:56:14,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:14,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037376] [2022-11-18 19:56:14,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:14,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:14,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:14,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037376] [2022-11-18 19:56:14,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:14,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:14,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:56:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097270292] [2022-11-18 19:56:14,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:14,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:56:14,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:14,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:56:14,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:56:14,544 INFO L87 Difference]: Start difference. First operand 267 states and 623 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:14,728 INFO L93 Difference]: Finished difference Result 214 states and 482 transitions. [2022-11-18 19:56:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:56:14,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-18 19:56:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:14,730 INFO L225 Difference]: With dead ends: 214 [2022-11-18 19:56:14,730 INFO L226 Difference]: Without dead ends: 184 [2022-11-18 19:56:14,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:56:14,731 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 9 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.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:14,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 9 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:56:14,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-18 19:56:14,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2022-11-18 19:56:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 176 states have (on average 2.210227272727273) internal successors, (389), 183 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 389 transitions. [2022-11-18 19:56:14,737 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 389 transitions. Word has length 10 [2022-11-18 19:56:14,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:14,739 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 389 transitions. [2022-11-18 19:56:14,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 389 transitions. [2022-11-18 19:56:14,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 19:56:14,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:14,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:14,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 19:56:14,740 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:14,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1874592388, now seen corresponding path program 1 times [2022-11-18 19:56:14,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:14,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76444190] [2022-11-18 19:56:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:14,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:14,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:14,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76444190] [2022-11-18 19:56:14,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76444190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:14,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:14,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:56:14,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395047298] [2022-11-18 19:56:14,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:14,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:56:14,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:14,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:56:14,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:56:14,976 INFO L87 Difference]: Start difference. First operand 184 states and 389 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:15,091 INFO L93 Difference]: Finished difference Result 174 states and 338 transitions. [2022-11-18 19:56:15,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:56:15,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-18 19:56:15,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:15,093 INFO L225 Difference]: With dead ends: 174 [2022-11-18 19:56:15,093 INFO L226 Difference]: Without dead ends: 174 [2022-11-18 19:56:15,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:56:15,094 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 34 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:15,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 5 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:56:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-18 19:56:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 151. [2022-11-18 19:56:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 143 states have (on average 2.125874125874126) internal successors, (304), 150 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 304 transitions. [2022-11-18 19:56:15,099 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 304 transitions. Word has length 10 [2022-11-18 19:56:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:15,099 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 304 transitions. [2022-11-18 19:56:15,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 304 transitions. [2022-11-18 19:56:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:56:15,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:15,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:15,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 19:56:15,101 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:15,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1561726493, now seen corresponding path program 1 times [2022-11-18 19:56:15,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:15,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440603447] [2022-11-18 19:56:15,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:15,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:16,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:16,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:16,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440603447] [2022-11-18 19:56:16,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440603447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:16,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:16,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:56:16,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215410910] [2022-11-18 19:56:16,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:16,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:56:16,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:16,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:56:16,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:56:16,154 INFO L87 Difference]: Start difference. First operand 151 states and 304 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:16,408 INFO L93 Difference]: Finished difference Result 202 states and 421 transitions. [2022-11-18 19:56:16,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:56:16,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-18 19:56:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:16,410 INFO L225 Difference]: With dead ends: 202 [2022-11-18 19:56:16,410 INFO L226 Difference]: Without dead ends: 202 [2022-11-18 19:56:16,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:56:16,411 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:16,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 11 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:56:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-18 19:56:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 172. [2022-11-18 19:56:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 164 states have (on average 2.152439024390244) internal successors, (353), 171 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 353 transitions. [2022-11-18 19:56:16,417 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 353 transitions. Word has length 11 [2022-11-18 19:56:16,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:16,417 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 353 transitions. [2022-11-18 19:56:16,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:16,417 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 353 transitions. [2022-11-18 19:56:16,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:56:16,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:16,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:16,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 19:56:16,418 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:16,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:16,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2019230563, now seen corresponding path program 2 times [2022-11-18 19:56:16,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:16,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582789472] [2022-11-18 19:56:16,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:16,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:17,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:17,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582789472] [2022-11-18 19:56:17,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582789472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:17,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:17,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:56:17,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69039180] [2022-11-18 19:56:17,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:17,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:56:17,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:17,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:56:17,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:56:17,591 INFO L87 Difference]: Start difference. First operand 172 states and 353 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:18,225 INFO L93 Difference]: Finished difference Result 220 states and 465 transitions. [2022-11-18 19:56:18,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:56:18,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-18 19:56:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:18,230 INFO L225 Difference]: With dead ends: 220 [2022-11-18 19:56:18,231 INFO L226 Difference]: Without dead ends: 220 [2022-11-18 19:56:18,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2022-11-18 19:56:18,231 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 71 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:18,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 8 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:56:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-18 19:56:18,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 172. [2022-11-18 19:56:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 164 states have (on average 2.152439024390244) internal successors, (353), 171 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 353 transitions. [2022-11-18 19:56:18,237 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 353 transitions. Word has length 11 [2022-11-18 19:56:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:18,237 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 353 transitions. [2022-11-18 19:56:18,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:18,238 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 353 transitions. [2022-11-18 19:56:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:56:18,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:18,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:18,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 19:56:18,241 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:18,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:18,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2017174904, now seen corresponding path program 1 times [2022-11-18 19:56:18,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:18,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655922859] [2022-11-18 19:56:18,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:18,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:18,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:18,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655922859] [2022-11-18 19:56:18,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655922859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:18,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:18,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:56:18,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655158770] [2022-11-18 19:56:18,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:18,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:56:18,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:18,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:56:18,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:56:18,322 INFO L87 Difference]: Start difference. First operand 172 states and 353 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-18 19:56:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:18,392 INFO L93 Difference]: Finished difference Result 163 states and 343 transitions. [2022-11-18 19:56:18,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:56:18,393 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-18 19:56:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:18,393 INFO L225 Difference]: With dead ends: 163 [2022-11-18 19:56:18,393 INFO L226 Difference]: Without dead ends: 79 [2022-11-18 19:56:18,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:56:18,394 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:18,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:56:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-18 19:56:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-18 19:56:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.935897435897436) internal successors, (151), 78 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 151 transitions. [2022-11-18 19:56:18,397 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 151 transitions. Word has length 11 [2022-11-18 19:56:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:18,398 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 151 transitions. [2022-11-18 19:56:18,398 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-18 19:56:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 151 transitions. [2022-11-18 19:56:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:56:18,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:18,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:18,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 19:56:18,401 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:18,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:18,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1615945913, now seen corresponding path program 3 times [2022-11-18 19:56:18,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:18,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352806977] [2022-11-18 19:56:18,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:18,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:19,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:19,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352806977] [2022-11-18 19:56:19,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352806977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:19,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:19,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:56:19,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621945714] [2022-11-18 19:56:19,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:19,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:56:19,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:19,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:56:19,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:56:19,269 INFO L87 Difference]: Start difference. First operand 79 states and 151 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:19,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:19,498 INFO L93 Difference]: Finished difference Result 77 states and 146 transitions. [2022-11-18 19:56:19,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:56:19,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-18 19:56:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:19,499 INFO L225 Difference]: With dead ends: 77 [2022-11-18 19:56:19,499 INFO L226 Difference]: Without dead ends: 77 [2022-11-18 19:56:19,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:56:19,500 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:19,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:56:19,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-18 19:56:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-11-18 19:56:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 55 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 105 transitions. [2022-11-18 19:56:19,502 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 105 transitions. Word has length 11 [2022-11-18 19:56:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:19,503 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 105 transitions. [2022-11-18 19:56:19,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 105 transitions. [2022-11-18 19:56:19,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 19:56:19,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:19,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:19,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 19:56:19,503 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:19,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:19,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1168884467, now seen corresponding path program 1 times [2022-11-18 19:56:19,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:19,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341203870] [2022-11-18 19:56:19,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:19,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:19,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:19,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341203870] [2022-11-18 19:56:19,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341203870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:19,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:19,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:56:19,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341016826] [2022-11-18 19:56:19,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:19,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:56:19,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:19,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:56:19,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:19,749 INFO L87 Difference]: Start difference. First operand 56 states and 105 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:19,792 INFO L93 Difference]: Finished difference Result 42 states and 67 transitions. [2022-11-18 19:56:19,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:56:19,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-18 19:56:19,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:19,794 INFO L225 Difference]: With dead ends: 42 [2022-11-18 19:56:19,794 INFO L226 Difference]: Without dead ends: 42 [2022-11-18 19:56:19,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:19,795 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:19,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 5 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:56:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-18 19:56:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-18 19:56:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 41 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 67 transitions. [2022-11-18 19:56:19,799 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 67 transitions. Word has length 12 [2022-11-18 19:56:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:19,801 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 67 transitions. [2022-11-18 19:56:19,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 67 transitions. [2022-11-18 19:56:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 19:56:19,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:19,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:19,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 19:56:19,802 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:19,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:19,804 INFO L85 PathProgramCache]: Analyzing trace with hash 346302602, now seen corresponding path program 1 times [2022-11-18 19:56:19,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:19,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237496195] [2022-11-18 19:56:19,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:19,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:20,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:20,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237496195] [2022-11-18 19:56:20,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237496195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:20,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:20,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:56:20,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211735076] [2022-11-18 19:56:20,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:20,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:56:20,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:20,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:56:20,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:56:20,037 INFO L87 Difference]: Start difference. First operand 42 states and 67 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:20,091 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2022-11-18 19:56:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:56:20,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-11-18 19:56:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:20,092 INFO L225 Difference]: With dead ends: 29 [2022-11-18 19:56:20,092 INFO L226 Difference]: Without dead ends: 29 [2022-11-18 19:56:20,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:56:20,093 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:20,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:56:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-18 19:56:20,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-18 19:56:20,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-11-18 19:56:20,095 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 13 [2022-11-18 19:56:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:20,096 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2022-11-18 19:56:20,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2022-11-18 19:56:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 19:56:20,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:20,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:20,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 19:56:20,097 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:56:20,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:20,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1675769225, now seen corresponding path program 1 times [2022-11-18 19:56:20,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:20,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896126589] [2022-11-18 19:56:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:56:20,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:56:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:56:20,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 19:56:20,231 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:56:20,233 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (57 of 58 remaining) [2022-11-18 19:56:20,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 58 remaining) [2022-11-18 19:56:20,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 58 remaining) [2022-11-18 19:56:20,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 58 remaining) [2022-11-18 19:56:20,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 58 remaining) [2022-11-18 19:56:20,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 58 remaining) [2022-11-18 19:56:20,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 58 remaining) [2022-11-18 19:56:20,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 58 remaining) [2022-11-18 19:56:20,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 58 remaining) [2022-11-18 19:56:20,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 58 remaining) [2022-11-18 19:56:20,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 58 remaining) [2022-11-18 19:56:20,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 58 remaining) [2022-11-18 19:56:20,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 58 remaining) [2022-11-18 19:56:20,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 58 remaining) [2022-11-18 19:56:20,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 58 remaining) [2022-11-18 19:56:20,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 58 remaining) [2022-11-18 19:56:20,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 58 remaining) [2022-11-18 19:56:20,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 58 remaining) [2022-11-18 19:56:20,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 58 remaining) [2022-11-18 19:56:20,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 58 remaining) [2022-11-18 19:56:20,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 58 remaining) [2022-11-18 19:56:20,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 58 remaining) [2022-11-18 19:56:20,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 58 remaining) [2022-11-18 19:56:20,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 58 remaining) [2022-11-18 19:56:20,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 58 remaining) [2022-11-18 19:56:20,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 58 remaining) [2022-11-18 19:56:20,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 58 remaining) [2022-11-18 19:56:20,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 58 remaining) [2022-11-18 19:56:20,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 58 remaining) [2022-11-18 19:56:20,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 58 remaining) [2022-11-18 19:56:20,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 58 remaining) [2022-11-18 19:56:20,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 58 remaining) [2022-11-18 19:56:20,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 58 remaining) [2022-11-18 19:56:20,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (24 of 58 remaining) [2022-11-18 19:56:20,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 58 remaining) [2022-11-18 19:56:20,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 58 remaining) [2022-11-18 19:56:20,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 58 remaining) [2022-11-18 19:56:20,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 58 remaining) [2022-11-18 19:56:20,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 58 remaining) [2022-11-18 19:56:20,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 58 remaining) [2022-11-18 19:56:20,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 58 remaining) [2022-11-18 19:56:20,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 58 remaining) [2022-11-18 19:56:20,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 58 remaining) [2022-11-18 19:56:20,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 58 remaining) [2022-11-18 19:56:20,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 58 remaining) [2022-11-18 19:56:20,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 58 remaining) [2022-11-18 19:56:20,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 58 remaining) [2022-11-18 19:56:20,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 58 remaining) [2022-11-18 19:56:20,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 58 remaining) [2022-11-18 19:56:20,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 58 remaining) [2022-11-18 19:56:20,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 58 remaining) [2022-11-18 19:56:20,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 58 remaining) [2022-11-18 19:56:20,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 58 remaining) [2022-11-18 19:56:20,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 58 remaining) [2022-11-18 19:56:20,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 58 remaining) [2022-11-18 19:56:20,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 58 remaining) [2022-11-18 19:56:20,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 58 remaining) [2022-11-18 19:56:20,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 58 remaining) [2022-11-18 19:56:20,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 19:56:20,250 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:20,256 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 19:56:20,256 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:56:20,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:56:20 BasicIcfg [2022-11-18 19:56:20,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:56:20,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:56:20,312 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:56:20,312 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:56:20,312 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:55:46" (3/4) ... [2022-11-18 19:56:20,315 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 19:56:20,315 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:56:20,316 INFO L158 Benchmark]: Toolchain (without parser) took 36759.23ms. Allocated memory was 138.4MB in the beginning and 482.3MB in the end (delta: 343.9MB). Free memory was 101.8MB in the beginning and 366.9MB in the end (delta: -265.1MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. [2022-11-18 19:56:20,316 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 88.1MB. Free memory was 60.8MB in the beginning and 60.8MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:56:20,317 INFO L158 Benchmark]: CACSL2BoogieTranslator took 829.64ms. Allocated memory is still 138.4MB. Free memory was 101.5MB in the beginning and 100.9MB in the end (delta: 581.6kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 19:56:20,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.76ms. Allocated memory is still 138.4MB. Free memory was 100.2MB in the beginning and 98.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:56:20,317 INFO L158 Benchmark]: Boogie Preprocessor took 31.28ms. Allocated memory is still 138.4MB. Free memory was 98.2MB in the beginning and 96.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:56:20,318 INFO L158 Benchmark]: RCFGBuilder took 1541.54ms. Allocated memory is still 138.4MB. Free memory was 96.1MB in the beginning and 84.0MB in the end (delta: 12.1MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2022-11-18 19:56:20,318 INFO L158 Benchmark]: TraceAbstraction took 34256.04ms. Allocated memory was 138.4MB in the beginning and 482.3MB in the end (delta: 343.9MB). Free memory was 82.9MB in the beginning and 366.9MB in the end (delta: -283.9MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2022-11-18 19:56:20,318 INFO L158 Benchmark]: Witness Printer took 4.00ms. Allocated memory is still 482.3MB. Free memory is still 366.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:56:20,320 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.29ms. Allocated memory is still 88.1MB. Free memory was 60.8MB in the beginning and 60.8MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 829.64ms. Allocated memory is still 138.4MB. Free memory was 101.5MB in the beginning and 100.9MB in the end (delta: 581.6kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.76ms. Allocated memory is still 138.4MB. Free memory was 100.2MB in the beginning and 98.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.28ms. Allocated memory is still 138.4MB. Free memory was 98.2MB in the beginning and 96.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1541.54ms. Allocated memory is still 138.4MB. Free memory was 96.1MB in the beginning and 84.0MB in the end (delta: 12.1MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34256.04ms. Allocated memory was 138.4MB in the beginning and 482.3MB in the end (delta: 343.9MB). Free memory was 82.9MB in the beginning and 366.9MB in the end (delta: -283.9MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. * Witness Printer took 4.00ms. Allocated memory is still 482.3MB. Free memory is still 366.9MB. 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: 23.5s, 151 PlacesBefore, 60 PlacesAfterwards, 146 TransitionsBefore, 54 TransitionsAfterwards, 3768 CoEnabledTransitionPairs, 8 FixpointIterations, 64 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 12400 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7291, independent: 7020, independent conditional: 0, independent unconditional: 7020, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 29, unknown conditional: 0, unknown unconditional: 29] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2645, independent: 2588, independent conditional: 0, independent unconditional: 2588, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2645, independent: 2331, independent conditional: 0, independent unconditional: 2331, dependent: 314, dependent conditional: 0, dependent unconditional: 314, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 314, independent: 257, independent conditional: 0, independent unconditional: 257, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2433, independent: 1640, independent conditional: 0, independent unconditional: 1640, dependent: 638, dependent conditional: 0, dependent unconditional: 638, unknown: 155, unknown conditional: 0, unknown unconditional: 155] ], Cache Queries: [ total: 7291, independent: 4432, independent conditional: 0, independent unconditional: 4432, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 2670, unknown conditional: 0, unknown unconditional: 2670] , Statistics on independence cache: Total cache size (in pairs): 414, Positive cache size: 392, Positive conditional cache size: 0, Positive unconditional cache size: 392, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L744] 0 int y$w_buff0; [L746] 0 int y$w_buff1; [L711] 0 int __unbuffered_p0_EAX = 0; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L738] 0 _Bool y$r_buff0_thd2; [L735] 0 int y$mem_tmp; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L727] 0 int __unbuffered_p1_EAX = 0; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L742] 0 _Bool y$read_delayed; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L709] 0 int __unbuffered_cnt = 0; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L734] 0 _Bool y$flush_delayed; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L747] 0 _Bool y$w_buff1_used; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L729] 0 _Bool main$tmp_guard1; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L728] 0 _Bool main$tmp_guard0; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L743] 0 int *y$read_delayed_var; [L745] 0 _Bool y$w_buff0_used; [L731] 0 int x = 0; [L739] 0 _Bool y$r_buff1_thd0; [L733] 0 int y = 0; [L741] 0 _Bool y$r_buff1_thd2; [L740] 0 _Bool y$r_buff1_thd1; [L813] 0 pthread_t t1921; [L814] FCALL, FORK 0 pthread_create(&t1921, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1921, ((void *)0), P0, ((void *)0))=-1, t1921={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] EXPR 1 \read(y) [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 1 return 0; [L815] 0 pthread_t t1922; [L816] FCALL, FORK 0 pthread_create(&t1922, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1922, ((void *)0), P1, ((void *)0))=0, t1921={6:0}, t1922={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 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) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 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 [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 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_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 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) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921={6:0}, t1922={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 184 locations, 58 error locations. Started 1 CEGAR loops. OverallTime: 34.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 23.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 410 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 410 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 885 IncrementalHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 50 mSDtfsCounter, 885 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3178occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 299 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 1521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 19:56:20,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 19:56:22,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:56:22,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:56:22,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:56:22,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:56:22,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:56:22,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:56:22,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:56:22,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:56:22,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:56:22,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:56:22,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:56:22,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:56:22,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:56:22,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:56:22,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:56:22,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:56:22,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:56:22,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:56:22,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:56:22,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:56:22,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:56:22,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:56:22,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:56:22,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:56:22,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:56:22,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:56:22,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:56:22,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:56:22,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:56:22,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:56:22,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:56:22,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:56:22,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:56:22,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:56:22,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:56:22,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:56:22,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:56:22,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:56:22,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:56:22,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:56:22,725 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-18 19:56:22,750 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:56:22,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:56:22,751 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:56:22,751 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:56:22,752 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:56:22,755 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:56:22,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:56:22,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:56:22,757 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:56:22,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:56:22,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:56:22,758 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 19:56:22,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:56:22,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:56:22,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:56:22,762 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 19:56:22,763 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 19:56:22,763 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 19:56:22,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:56:22,763 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 19:56:22,764 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 19:56:22,764 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 19:56:22,764 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:56:22,764 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:56:22,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:56:22,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:56:22,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:56:22,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:56:22,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:56:22,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:56:22,767 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 19:56:22,767 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 19:56:22,768 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 19:56:22,768 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_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae [2022-11-18 19:56:23,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:56:23,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:56:23,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:56:23,133 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:56:23,134 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:56:23,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2022-11-18 19:56:23,211 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/data/53d50db02/8ab68e449d4c457985e65a47ae417333/FLAG2c25552f0 [2022-11-18 19:56:23,879 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:56:23,879 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2022-11-18 19:56:23,896 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/data/53d50db02/8ab68e449d4c457985e65a47ae417333/FLAG2c25552f0 [2022-11-18 19:56:24,138 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/data/53d50db02/8ab68e449d4c457985e65a47ae417333 [2022-11-18 19:56:24,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:56:24,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:56:24,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:56:24,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:56:24,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:56:24,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:56:24" (1/1) ... [2022-11-18 19:56:24,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87dc983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:24, skipping insertion in model container [2022-11-18 19:56:24,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:56:24" (1/1) ... [2022-11-18 19:56:24,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:56:24,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:56:24,364 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027] [2022-11-18 19:56:24,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:56:24,658 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:56:24,675 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027] [2022-11-18 19:56:24,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:56:24,761 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:56:24,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:24 WrapperNode [2022-11-18 19:56:24,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:56:24,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:56:24,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:56:24,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:56:24,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:24" (1/1) ... [2022-11-18 19:56:24,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:24" (1/1) ... [2022-11-18 19:56:24,843 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2022-11-18 19:56:24,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:56:24,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:56:24,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:56:24,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:56:24,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:24" (1/1) ... [2022-11-18 19:56:24,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:24" (1/1) ... [2022-11-18 19:56:24,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:24" (1/1) ... [2022-11-18 19:56:24,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:24" (1/1) ... [2022-11-18 19:56:24,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:24" (1/1) ... [2022-11-18 19:56:24,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:24" (1/1) ... [2022-11-18 19:56:24,906 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:24" (1/1) ... [2022-11-18 19:56:24,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:24" (1/1) ... [2022-11-18 19:56:24,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:56:24,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:56:24,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:56:24,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:56:24,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:24" (1/1) ... [2022-11-18 19:56:24,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:56:24,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:56:24,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:56:24,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:56:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-18 19:56:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 19:56:25,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:56:25,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:56:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:56:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 19:56:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 19:56:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-18 19:56:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 19:56:25,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 19:56:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 19:56:25,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 19:56:25,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 19:56:25,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:56:25,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:56:25,031 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 19:56:25,324 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:56:25,326 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:56:25,850 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:56:26,674 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:56:26,675 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:56:26,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:56:26 BoogieIcfgContainer [2022-11-18 19:56:26,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:56:26,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:56:26,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:56:26,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:56:26,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:56:24" (1/3) ... [2022-11-18 19:56:26,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd2d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:56:26, skipping insertion in model container [2022-11-18 19:56:26,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:56:24" (2/3) ... [2022-11-18 19:56:26,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd2d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:56:26, skipping insertion in model container [2022-11-18 19:56:26,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:56:26" (3/3) ... [2022-11-18 19:56:26,692 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2022-11-18 19:56:26,711 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:56:26,711 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-11-18 19:56:26,711 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:56:26,884 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 19:56:26,933 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 19:56:26,954 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 147 transitions, 304 flow [2022-11-18 19:56:26,958 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 147 transitions, 304 flow [2022-11-18 19:56:26,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 147 transitions, 304 flow [2022-11-18 19:56:27,072 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-18 19:56:27,072 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:56:27,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 195 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-11-18 19:56:27,080 INFO L119 LiptonReduction]: Number of co-enabled transitions 3768 [2022-11-18 19:56:47,610 WARN L233 SmtUtils]: Spent 9.06s on a formula simplification. DAG size of input: 262 DAG size of output: 261 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-18 19:57:14,409 INFO L134 LiptonReduction]: Checked pairs total: 12400 [2022-11-18 19:57:14,409 INFO L136 LiptonReduction]: Total number of compositions: 139 [2022-11-18 19:57:14,418 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 60 places, 54 transitions, 118 flow [2022-11-18 19:57:14,558 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3178 states, 2072 states have (on average 4.337355212355212) internal successors, (8987), 3177 states have internal predecessors, (8987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:14,579 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:57:14,584 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;@61d24c8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:57:14,585 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2022-11-18 19:57:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 3178 states, 2072 states have (on average 4.337355212355212) internal successors, (8987), 3177 states have internal predecessors, (8987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:14,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 19:57:14,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:57:14,602 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 19:57:14,603 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:57:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:57:14,609 INFO L85 PathProgramCache]: Analyzing trace with hash 915, now seen corresponding path program 1 times [2022-11-18 19:57:14,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:57:14,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874721289] [2022-11-18 19:57:14,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:57:14,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:57:14,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:57:14,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:57:14,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-18 19:57:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:57:14,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 19:57:14,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:57:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:57:14,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:57:14,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:57:14,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874721289] [2022-11-18 19:57:14,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874721289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:57:14,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:57:14,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 19:57:14,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240910656] [2022-11-18 19:57:14,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:57:14,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:57:14,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:57:14,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:57:14,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:57:14,929 INFO L87 Difference]: Start difference. First operand has 3178 states, 2072 states have (on average 4.337355212355212) internal successors, (8987), 3177 states have internal predecessors, (8987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:57:15,105 INFO L93 Difference]: Finished difference Result 770 states and 2021 transitions. [2022-11-18 19:57:15,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:57:15,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-18 19:57:15,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:57:15,126 INFO L225 Difference]: With dead ends: 770 [2022-11-18 19:57:15,126 INFO L226 Difference]: Without dead ends: 770 [2022-11-18 19:57:15,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:57:15,131 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:57:15,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:57:15,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-18 19:57:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-11-18 19:57:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 636 states have (on average 3.1776729559748427) internal successors, (2021), 769 states have internal predecessors, (2021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2021 transitions. [2022-11-18 19:57:15,225 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2021 transitions. Word has length 1 [2022-11-18 19:57:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:57:15,226 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 2021 transitions. [2022-11-18 19:57:15,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2021 transitions. [2022-11-18 19:57:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 19:57:15,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:57:15,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 19:57:15,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-18 19:57:15,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:57:15,441 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:57:15,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:57:15,441 INFO L85 PathProgramCache]: Analyzing trace with hash 902214, now seen corresponding path program 1 times [2022-11-18 19:57:15,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:57:15,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78516527] [2022-11-18 19:57:15,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:57:15,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:57:15,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:57:15,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:57:15,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-18 19:57:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:57:15,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:57:15,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:57:15,799 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:57:15,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-18 19:57:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:57:15,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:57:15,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:57:15,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78516527] [2022-11-18 19:57:15,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78516527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:57:15,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:57:15,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 19:57:15,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88506052] [2022-11-18 19:57:15,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:57:15,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:57:15,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:57:15,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:57:15,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:57:15,836 INFO L87 Difference]: Start difference. First operand 770 states and 2021 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:57:16,066 INFO L93 Difference]: Finished difference Result 443 states and 1109 transitions. [2022-11-18 19:57:16,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:57:16,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-18 19:57:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:57:16,071 INFO L225 Difference]: With dead ends: 443 [2022-11-18 19:57:16,072 INFO L226 Difference]: Without dead ends: 443 [2022-11-18 19:57:16,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:57:16,074 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:57:16,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:57:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-11-18 19:57:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2022-11-18 19:57:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 394 states have (on average 2.814720812182741) internal successors, (1109), 442 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1109 transitions. [2022-11-18 19:57:16,096 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1109 transitions. Word has length 3 [2022-11-18 19:57:16,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:57:16,097 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 1109 transitions. [2022-11-18 19:57:16,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:16,097 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1109 transitions. [2022-11-18 19:57:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 19:57:16,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:57:16,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 19:57:16,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:57:16,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:57:16,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:57:16,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:57:16,320 INFO L85 PathProgramCache]: Analyzing trace with hash 902215, now seen corresponding path program 1 times [2022-11-18 19:57:16,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:57:16,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671097278] [2022-11-18 19:57:16,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:57:16,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:57:16,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:57:16,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:57:16,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-18 19:57:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:57:16,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 19:57:16,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:57:16,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:57:16,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 19:57:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:57:16,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:57:16,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:57:16,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671097278] [2022-11-18 19:57:16,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671097278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:57:16,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:57:16,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 19:57:16,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691776870] [2022-11-18 19:57:16,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:57:16,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:57:16,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:57:16,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:57:16,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:57:16,617 INFO L87 Difference]: Start difference. First operand 443 states and 1109 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:57:16,731 INFO L93 Difference]: Finished difference Result 268 states and 643 transitions. [2022-11-18 19:57:16,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:57:16,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-18 19:57:16,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:57:16,733 INFO L225 Difference]: With dead ends: 268 [2022-11-18 19:57:16,733 INFO L226 Difference]: Without dead ends: 268 [2022-11-18 19:57:16,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:57:16,735 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:57:16,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:57:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-11-18 19:57:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-11-18 19:57:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 250 states have (on average 2.572) internal successors, (643), 267 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 643 transitions. [2022-11-18 19:57:16,745 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 643 transitions. Word has length 3 [2022-11-18 19:57:16,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:57:16,745 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 643 transitions. [2022-11-18 19:57:16,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 643 transitions. [2022-11-18 19:57:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 19:57:16,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:57:16,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:57:16,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-18 19:57:16,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:57:16,959 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:57:16,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:57:16,960 INFO L85 PathProgramCache]: Analyzing trace with hash 61150012, now seen corresponding path program 1 times [2022-11-18 19:57:16,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:57:16,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042824614] [2022-11-18 19:57:16,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:57:16,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:57:16,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:57:16,963 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:57:16,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-18 19:57:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:57:17,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:57:17,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:57:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:57:17,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:57:17,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:57:17,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042824614] [2022-11-18 19:57:17,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042824614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:57:17,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:57:17,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:57:17,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853227877] [2022-11-18 19:57:17,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:57:17,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:57:17,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:57:17,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:57:17,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:57:17,248 INFO L87 Difference]: Start difference. First operand 268 states and 643 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:17,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:57:17,409 INFO L93 Difference]: Finished difference Result 114 states and 200 transitions. [2022-11-18 19:57:17,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:57:17,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-18 19:57:17,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:57:17,411 INFO L225 Difference]: With dead ends: 114 [2022-11-18 19:57:17,411 INFO L226 Difference]: Without dead ends: 114 [2022-11-18 19:57:17,412 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-18 19:57:17,412 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:57:17,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 8 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:57:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-18 19:57:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-18 19:57:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 102 states have (on average 1.9607843137254901) internal successors, (200), 113 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 200 transitions. [2022-11-18 19:57:17,417 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 200 transitions. Word has length 7 [2022-11-18 19:57:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:57:17,417 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 200 transitions. [2022-11-18 19:57:17,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:17,418 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 200 transitions. [2022-11-18 19:57:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 19:57:17,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:57:17,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:57:17,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-18 19:57:17,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:57:17,635 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:57:17,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:57:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash 590375574, now seen corresponding path program 1 times [2022-11-18 19:57:17,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:57:17,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602449966] [2022-11-18 19:57:17,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:57:17,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:57:17,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:57:17,637 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:57:17,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-18 19:57:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:57:17,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:57:17,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:57:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:57:18,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:57:18,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:57:18,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602449966] [2022-11-18 19:57:18,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602449966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:57:18,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:57:18,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:57:18,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317844222] [2022-11-18 19:57:18,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:57:18,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:57:18,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:57:18,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:57:18,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:57:18,008 INFO L87 Difference]: Start difference. First operand 114 states and 200 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:57:18,193 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2022-11-18 19:57:18,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:57:18,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-18 19:57:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:57:18,195 INFO L225 Difference]: With dead ends: 42 [2022-11-18 19:57:18,195 INFO L226 Difference]: Without dead ends: 42 [2022-11-18 19:57:18,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:57:18,196 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:57:18,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:57:18,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-18 19:57:18,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-18 19:57:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.631578947368421) internal successors, (62), 41 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2022-11-18 19:57:18,199 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 10 [2022-11-18 19:57:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:57:18,199 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2022-11-18 19:57:18,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2022-11-18 19:57:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 19:57:18,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:57:18,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:57:18,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-18 19:57:18,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:57:18,403 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:57:18,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:57:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash 622128096, now seen corresponding path program 1 times [2022-11-18 19:57:18,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:57:18,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952258861] [2022-11-18 19:57:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:57:18,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:57:18,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:57:18,406 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:57:18,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-18 19:57:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:57:18,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 19:57:18,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:57:21,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 19:57:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:57:21,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:57:21,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:57:21,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952258861] [2022-11-18 19:57:21,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952258861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:57:21,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:57:21,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:57:21,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395580723] [2022-11-18 19:57:21,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:57:21,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:57:21,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:57:21,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:57:21,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:57:21,096 INFO L87 Difference]: Start difference. First operand 42 states and 62 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-18 19:57:21,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:57:21,230 INFO L93 Difference]: Finished difference Result 41 states and 61 transitions. [2022-11-18 19:57:21,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:57:21,231 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-18 19:57:21,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:57:21,231 INFO L225 Difference]: With dead ends: 41 [2022-11-18 19:57:21,231 INFO L226 Difference]: Without dead ends: 41 [2022-11-18 19:57:21,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:57:21,232 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:57:21,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:57:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-18 19:57:21,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-18 19:57:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.605263157894737) internal successors, (61), 40 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:57:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2022-11-18 19:57:21,235 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 14 [2022-11-18 19:57:21,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:57:21,235 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2022-11-18 19:57:21,235 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-18 19:57:21,235 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2022-11-18 19:57:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 19:57:21,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:57:21,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:57:21,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-18 19:57:21,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:57:21,437 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:57:21,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:57:21,437 INFO L85 PathProgramCache]: Analyzing trace with hash 622128097, now seen corresponding path program 1 times [2022-11-18 19:57:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:57:21,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883800824] [2022-11-18 19:57:21,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:57:21,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:57:21,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:57:21,439 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:57:21,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-18 19:57:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:57:21,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:57:21,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:58:02,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 19:58:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:58:02,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:58:02,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:58:02,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883800824] [2022-11-18 19:58:02,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883800824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:58:02,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:58:02,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:58:02,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517114308] [2022-11-18 19:58:02,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:58:02,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:58:02,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:58:02,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:58:02,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:58:02,547 INFO L87 Difference]: Start difference. First operand 41 states and 61 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-18 19:58:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:58:02,678 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2022-11-18 19:58:02,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:58:02,679 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-18 19:58:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:58:02,679 INFO L225 Difference]: With dead ends: 40 [2022-11-18 19:58:02,679 INFO L226 Difference]: Without dead ends: 40 [2022-11-18 19:58:02,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:58:02,680 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:58:02,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:58:02,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-18 19:58:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-18 19:58:02,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 39 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:58:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2022-11-18 19:58:02,682 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 14 [2022-11-18 19:58:02,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:58:02,683 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. [2022-11-18 19:58:02,683 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-18 19:58:02,683 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2022-11-18 19:58:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 19:58:02,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:58:02,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:58:02,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-18 19:58:02,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:58:02,884 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:58:02,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:58:02,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2106099222, now seen corresponding path program 1 times [2022-11-18 19:58:02,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:58:02,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691308481] [2022-11-18 19:58:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:58:02,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:58:02,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:58:02,888 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:58:02,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-18 19:58:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:58:03,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 19:58:03,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:59:13,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 19:59:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:59:14,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:59:14,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:59:14,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691308481] [2022-11-18 19:59:14,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691308481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:59:14,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:59:14,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:59:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819510416] [2022-11-18 19:59:14,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:59:14,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:59:14,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:59:14,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:59:14,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:59:14,137 INFO L87 Difference]: Start difference. First operand 40 states and 60 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-18 19:59:14,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:59:14,519 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-11-18 19:59:14,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:59:14,520 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-18 19:59:14,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:59:14,520 INFO L225 Difference]: With dead ends: 53 [2022-11-18 19:59:14,520 INFO L226 Difference]: Without dead ends: 53 [2022-11-18 19:59:14,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:59:14,521 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:59:14,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:59:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-18 19:59:14,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2022-11-18 19:59:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:59:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2022-11-18 19:59:14,524 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 15 [2022-11-18 19:59:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:59:14,524 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2022-11-18 19:59:14,525 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-18 19:59:14,525 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2022-11-18 19:59:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 19:59:14,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:59:14,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:59:14,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-18 19:59:14,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:59:14,726 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-18 19:59:14,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:59:14,726 INFO L85 PathProgramCache]: Analyzing trace with hash -236683284, now seen corresponding path program 2 times [2022-11-18 19:59:14,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:59:14,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039251340] [2022-11-18 19:59:14,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:59:14,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:59:14,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:59:14,728 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:59:14,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-18 19:59:15,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 19:59:15,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 19:59:15,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:59:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:59:15,223 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-18 19:59:15,223 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:59:15,224 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (57 of 58 remaining) [2022-11-18 19:59:15,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 58 remaining) [2022-11-18 19:59:15,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 58 remaining) [2022-11-18 19:59:15,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 58 remaining) [2022-11-18 19:59:15,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 58 remaining) [2022-11-18 19:59:15,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 58 remaining) [2022-11-18 19:59:15,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 58 remaining) [2022-11-18 19:59:15,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 58 remaining) [2022-11-18 19:59:15,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 58 remaining) [2022-11-18 19:59:15,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 58 remaining) [2022-11-18 19:59:15,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 58 remaining) [2022-11-18 19:59:15,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 58 remaining) [2022-11-18 19:59:15,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 58 remaining) [2022-11-18 19:59:15,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 58 remaining) [2022-11-18 19:59:15,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 58 remaining) [2022-11-18 19:59:15,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 58 remaining) [2022-11-18 19:59:15,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 58 remaining) [2022-11-18 19:59:15,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 58 remaining) [2022-11-18 19:59:15,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 58 remaining) [2022-11-18 19:59:15,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 58 remaining) [2022-11-18 19:59:15,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 58 remaining) [2022-11-18 19:59:15,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 58 remaining) [2022-11-18 19:59:15,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 58 remaining) [2022-11-18 19:59:15,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 58 remaining) [2022-11-18 19:59:15,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 58 remaining) [2022-11-18 19:59:15,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 58 remaining) [2022-11-18 19:59:15,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 58 remaining) [2022-11-18 19:59:15,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 58 remaining) [2022-11-18 19:59:15,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 58 remaining) [2022-11-18 19:59:15,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 58 remaining) [2022-11-18 19:59:15,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 58 remaining) [2022-11-18 19:59:15,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 58 remaining) [2022-11-18 19:59:15,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 58 remaining) [2022-11-18 19:59:15,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (24 of 58 remaining) [2022-11-18 19:59:15,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 58 remaining) [2022-11-18 19:59:15,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 58 remaining) [2022-11-18 19:59:15,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 58 remaining) [2022-11-18 19:59:15,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 58 remaining) [2022-11-18 19:59:15,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 58 remaining) [2022-11-18 19:59:15,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 58 remaining) [2022-11-18 19:59:15,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 58 remaining) [2022-11-18 19:59:15,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 58 remaining) [2022-11-18 19:59:15,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 58 remaining) [2022-11-18 19:59:15,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 58 remaining) [2022-11-18 19:59:15,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 58 remaining) [2022-11-18 19:59:15,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 58 remaining) [2022-11-18 19:59:15,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 58 remaining) [2022-11-18 19:59:15,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 58 remaining) [2022-11-18 19:59:15,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 58 remaining) [2022-11-18 19:59:15,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 58 remaining) [2022-11-18 19:59:15,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 58 remaining) [2022-11-18 19:59:15,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 58 remaining) [2022-11-18 19:59:15,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 58 remaining) [2022-11-18 19:59:15,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 58 remaining) [2022-11-18 19:59:15,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 58 remaining) [2022-11-18 19:59:15,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 58 remaining) [2022-11-18 19:59:15,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 58 remaining) [2022-11-18 19:59:15,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 58 remaining) [2022-11-18 19:59:15,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-18 19:59:15,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:59:15,466 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:59:15,471 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 19:59:15,472 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:59:15,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:59:15 BasicIcfg [2022-11-18 19:59:15,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:59:15,552 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:59:15,553 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:59:15,553 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:59:15,553 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:56:26" (3/4) ... [2022-11-18 19:59:15,557 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 19:59:15,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:59:15,557 INFO L158 Benchmark]: Toolchain (without parser) took 171415.25ms. Allocated memory was 62.9MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 42.3MB in the beginning and 424.6MB in the end (delta: -382.3MB). Peak memory consumption was 635.2MB. Max. memory is 16.1GB. [2022-11-18 19:59:15,558 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 62.9MB. Free memory was 45.6MB in the beginning and 45.5MB in the end (delta: 50.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:59:15,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.76ms. Allocated memory is still 62.9MB. Free memory was 42.0MB in the beginning and 34.4MB in the end (delta: 7.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-18 19:59:15,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.00ms. Allocated memory is still 62.9MB. Free memory was 34.2MB in the beginning and 31.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:59:15,559 INFO L158 Benchmark]: Boogie Preprocessor took 67.36ms. Allocated memory is still 62.9MB. Free memory was 31.7MB in the beginning and 29.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:59:15,559 INFO L158 Benchmark]: RCFGBuilder took 1765.71ms. Allocated memory was 62.9MB in the beginning and 113.2MB in the end (delta: 50.3MB). Free memory was 29.5MB in the beginning and 83.6MB in the end (delta: -54.1MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2022-11-18 19:59:15,567 INFO L158 Benchmark]: TraceAbstraction took 168867.87ms. Allocated memory was 113.2MB in the beginning and 1.1GB in the end (delta: 968.9MB). Free memory was 82.7MB in the beginning and 425.7MB in the end (delta: -343.0MB). Peak memory consumption was 626.7MB. Max. memory is 16.1GB. [2022-11-18 19:59:15,568 INFO L158 Benchmark]: Witness Printer took 4.45ms. Allocated memory is still 1.1GB. Free memory is still 424.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:59:15,570 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.22ms. Allocated memory is still 62.9MB. Free memory was 45.6MB in the beginning and 45.5MB in the end (delta: 50.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.76ms. Allocated memory is still 62.9MB. Free memory was 42.0MB in the beginning and 34.4MB in the end (delta: 7.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.00ms. Allocated memory is still 62.9MB. Free memory was 34.2MB in the beginning and 31.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.36ms. Allocated memory is still 62.9MB. Free memory was 31.7MB in the beginning and 29.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1765.71ms. Allocated memory was 62.9MB in the beginning and 113.2MB in the end (delta: 50.3MB). Free memory was 29.5MB in the beginning and 83.6MB in the end (delta: -54.1MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * TraceAbstraction took 168867.87ms. Allocated memory was 113.2MB in the beginning and 1.1GB in the end (delta: 968.9MB). Free memory was 82.7MB in the beginning and 425.7MB in the end (delta: -343.0MB). Peak memory consumption was 626.7MB. Max. memory is 16.1GB. * Witness Printer took 4.45ms. Allocated memory is still 1.1GB. Free memory is still 424.6MB. 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: 47.5s, 152 PlacesBefore, 60 PlacesAfterwards, 147 TransitionsBefore, 54 TransitionsAfterwards, 3768 CoEnabledTransitionPairs, 8 FixpointIterations, 61 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 139 TotalNumberOfCompositions, 12400 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6702, independent: 6431, independent conditional: 0, independent unconditional: 6431, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 35, unknown conditional: 0, unknown unconditional: 35] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2538, independent: 2481, independent conditional: 0, independent unconditional: 2481, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2538, independent: 2220, independent conditional: 0, independent unconditional: 2220, dependent: 318, dependent conditional: 0, dependent unconditional: 318, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 318, independent: 261, independent conditional: 0, independent unconditional: 261, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5047, independent: 3725, independent conditional: 0, independent unconditional: 3725, dependent: 1106, dependent conditional: 0, dependent unconditional: 1106, unknown: 216, unknown conditional: 0, unknown unconditional: 216] ], Cache Queries: [ total: 6702, independent: 3950, independent conditional: 0, independent unconditional: 3950, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 2569, unknown conditional: 0, unknown unconditional: 2569] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 380, Positive conditional cache size: 0, Positive unconditional cache size: 380, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 3, Unknown conditional cache size: 0, Unknown unconditional cache size: 3 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L744] 0 int y$w_buff0; [L746] 0 int y$w_buff1; [L711] 0 int __unbuffered_p0_EAX = 0; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L738] 0 _Bool y$r_buff0_thd2; [L735] 0 int y$mem_tmp; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L727] 0 int __unbuffered_p1_EAX = 0; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L742] 0 _Bool y$read_delayed; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L709] 0 int __unbuffered_cnt = 0; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L734] 0 _Bool y$flush_delayed; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L747] 0 _Bool y$w_buff1_used; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L729] 0 _Bool main$tmp_guard1; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L728] 0 _Bool main$tmp_guard0; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L743] 0 int *y$read_delayed_var; [L745] 0 _Bool y$w_buff0_used; [L731] 0 int x = 0; [L739] 0 _Bool y$r_buff1_thd0; [L733] 0 int y = 0; [L741] 0 _Bool y$r_buff1_thd2; [L740] 0 _Bool y$r_buff1_thd1; [L813] 0 pthread_t t1921; [L814] FCALL, FORK 0 pthread_create(&t1921, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1921, ((void *)0), P0, ((void *)0))=0, t1921={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t1922; [L816] FCALL, FORK 0 pthread_create(&t1922, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1922, ((void *)0), P1, ((void *)0))=1, t1921={7:0}, t1922={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] EXPR 1 \read(y) [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 1 return 0; [L788] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 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) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 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 [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 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_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 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) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921={7:0}, t1922={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=2, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 185 locations, 58 error locations. Started 1 CEGAR loops. OverallTime: 168.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 47.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 321 IncrementalHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 25 mSDtfsCounter, 321 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3178occurred in iteration=0, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 114.6s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 523 SizeOfPredicates, 54 NumberOfNonLiveVariables, 801 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 19:59:15,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea900ac-7ecd-404d-bb8a-7a5c56b19dd9/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample