./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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_97079215-39f9-442a-92cb-8d9a89a08696/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 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 --- 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:54:51,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:54:51,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:54:52,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:54:52,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:54:52,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:54:52,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:54:52,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:54:52,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:54:52,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:54:52,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:54:52,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:54:52,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:54:52,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:54:52,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:54:52,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:54:52,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:54:52,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:54:52,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:54:52,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:54:52,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:54:52,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:54:52,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:54:52,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:54:52,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:54:52,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:54:52,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:54:52,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:54:52,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:54:52,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:54:52,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:54:52,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:54:52,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:54:52,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:54:52,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:54:52,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:54:52,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:54:52,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:54:52,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:54:52,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:54:52,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:54:52,096 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 19:54:52,137 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:54:52,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:54:52,138 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:54:52,138 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:54:52,139 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:54:52,139 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:54:52,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:54:52,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:54:52,141 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:54:52,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:54:52,142 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:54:52,143 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 19:54:52,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:54:52,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:54:52,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:54:52,144 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 19:54:52,144 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 19:54:52,144 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 19:54:52,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:54:52,145 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 19:54:52,145 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:54:52,160 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:54:52,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:54:52,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:54:52,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:54:52,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:54:52,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:54:52,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:54:52,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:54:52,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:54:52,163 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_97079215-39f9-442a-92cb-8d9a89a08696/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_97079215-39f9-442a-92cb-8d9a89a08696/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 -> 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 [2022-11-18 19:54:52,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:54:52,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:54:52,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:54:52,483 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:54:52,483 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:54:52,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-11-18 19:54:52,559 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/data/a07cc858b/4d4d834b3bc0495782ff3a11e58c4d7e/FLAG9e1b350ca [2022-11-18 19:54:53,079 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:54:53,079 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-11-18 19:54:53,095 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/data/a07cc858b/4d4d834b3bc0495782ff3a11e58c4d7e/FLAG9e1b350ca [2022-11-18 19:54:53,389 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/data/a07cc858b/4d4d834b3bc0495782ff3a11e58c4d7e [2022-11-18 19:54:53,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:54:53,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:54:53,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:54:53,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:54:53,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:54:53,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:54:53" (1/1) ... [2022-11-18 19:54:53,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a6d2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:53, skipping insertion in model container [2022-11-18 19:54:53,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:54:53" (1/1) ... [2022-11-18 19:54:53,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:54:53,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:54:53,732 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_97079215-39f9-442a-92cb-8d9a89a08696/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-11-18 19:54:53,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:54:53,956 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:54:53,979 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_97079215-39f9-442a-92cb-8d9a89a08696/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-11-18 19:54:54,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:54:54,102 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:54:54,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:54 WrapperNode [2022-11-18 19:54:54,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:54:54,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:54:54,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:54:54,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:54:54,115 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:54:54" (1/1) ... [2022-11-18 19:54:54,153 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:54:54" (1/1) ... [2022-11-18 19:54:54,192 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-11-18 19:54:54,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:54:54,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:54:54,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:54:54,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:54:54,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:54" (1/1) ... [2022-11-18 19:54:54,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:54" (1/1) ... [2022-11-18 19:54:54,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:54" (1/1) ... [2022-11-18 19:54:54,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:54" (1/1) ... [2022-11-18 19:54:54,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:54" (1/1) ... [2022-11-18 19:54:54,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:54" (1/1) ... [2022-11-18 19:54:54,220 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:54" (1/1) ... [2022-11-18 19:54:54,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:54" (1/1) ... [2022-11-18 19:54:54,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:54:54,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:54:54,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:54:54,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:54:54,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:54" (1/1) ... [2022-11-18 19:54:54,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:54:54,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:54,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:54:54,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:54:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:54:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:54:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 19:54:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:54:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:54:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:54:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 19:54:54,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 19:54:54,343 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 19:54:54,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 19:54:54,343 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 19:54:54,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 19:54:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:54:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 19:54:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:54:54,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:54:54,346 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:54:54,570 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:54:54,572 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:54:55,299 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:54:55,732 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:54:55,732 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:54:55,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:54:55 BoogieIcfgContainer [2022-11-18 19:54:55,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:54:55,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:54:55,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:54:55,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:54:55,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:54:53" (1/3) ... [2022-11-18 19:54:55,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af2a2d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:54:55, skipping insertion in model container [2022-11-18 19:54:55,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:54" (2/3) ... [2022-11-18 19:54:55,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af2a2d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:54:55, skipping insertion in model container [2022-11-18 19:54:55,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:54:55" (3/3) ... [2022-11-18 19:54:55,746 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.opt.i [2022-11-18 19:54:55,769 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:54:55,769 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2022-11-18 19:54:55,769 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:54:55,906 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 19:54:55,955 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 19:54:55,973 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 181 transitions, 377 flow [2022-11-18 19:54:55,981 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 181 transitions, 377 flow [2022-11-18 19:54:55,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 181 transitions, 377 flow [2022-11-18 19:54:56,097 INFO L130 PetriNetUnfolder]: 2/178 cut-off events. [2022-11-18 19:54:56,098 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:54:56,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 2/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 254 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-11-18 19:54:56,111 INFO L119 LiptonReduction]: Number of co-enabled transitions 7128 [2022-11-18 19:55:11,580 INFO L134 LiptonReduction]: Checked pairs total: 26031 [2022-11-18 19:55:11,580 INFO L136 LiptonReduction]: Total number of compositions: 171 [2022-11-18 19:55:11,592 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 76 transitions, 167 flow [2022-11-18 19:55:13,374 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 0 states 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:55:13,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:55:13,409 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;@6258f4c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:55:13,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-11-18 19:55:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 0 states 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:55:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 19:55:13,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:13,524 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 19:55:13,525 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:13,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:13,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2022-11-18 19:55:13,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:13,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879486278] [2022-11-18 19:55:13,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:13,693 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:55:13,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:13,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879486278] [2022-11-18 19:55:13,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879486278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:13,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:13,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 19:55:13,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439941051] [2022-11-18 19:55:13,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:13,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:55:13,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:13,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:55:13,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:55:13,826 INFO L87 Difference]: Start difference. First operand has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 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:55:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:14,326 INFO L93 Difference]: Finished difference Result 10092 states and 35895 transitions. [2022-11-18 19:55:14,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:55:14,329 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:55:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:14,447 INFO L225 Difference]: With dead ends: 10092 [2022-11-18 19:55:14,447 INFO L226 Difference]: Without dead ends: 10092 [2022-11-18 19:55:14,448 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:55:14,451 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:14,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:55:14,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10092 states. [2022-11-18 19:55:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10092 to 10092. [2022-11-18 19:55:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10092 states, 8770 states have (on average 4.092930444697833) internal successors, (35895), 10091 states have internal predecessors, (35895), 0 states have call successors, (0), 0 states 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:55:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10092 states to 10092 states and 35895 transitions. [2022-11-18 19:55:15,115 INFO L78 Accepts]: Start accepts. Automaton has 10092 states and 35895 transitions. Word has length 1 [2022-11-18 19:55:15,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:15,116 INFO L495 AbstractCegarLoop]: Abstraction has 10092 states and 35895 transitions. [2022-11-18 19:55:15,120 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:55:15,122 INFO L276 IsEmpty]: Start isEmpty. Operand 10092 states and 35895 transitions. [2022-11-18 19:55:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 19:55:15,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:15,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 19:55:15,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:55:15,125 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:15,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:15,126 INFO L85 PathProgramCache]: Analyzing trace with hash 31600937, now seen corresponding path program 1 times [2022-11-18 19:55:15,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:15,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029317290] [2022-11-18 19:55:15,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:15,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:15,451 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:55:15,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:15,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029317290] [2022-11-18 19:55:15,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029317290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:15,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:15,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 19:55:15,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026381066] [2022-11-18 19:55:15,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:15,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:55:15,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:15,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:55:15,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:55:15,455 INFO L87 Difference]: Start difference. First operand 10092 states and 35895 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:55:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:15,802 INFO L93 Difference]: Finished difference Result 7506 states and 24185 transitions. [2022-11-18 19:55:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:15,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-18 19:55:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:15,872 INFO L225 Difference]: With dead ends: 7506 [2022-11-18 19:55:15,872 INFO L226 Difference]: Without dead ends: 7502 [2022-11-18 19:55:15,872 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:55:15,873 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:15,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:55:15,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2022-11-18 19:55:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 6614. [2022-11-18 19:55:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6614 states, 6161 states have (on average 3.733971757831521) internal successors, (23005), 6613 states have internal predecessors, (23005), 0 states have call successors, (0), 0 states 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:55:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6614 states to 6614 states and 23005 transitions. [2022-11-18 19:55:16,251 INFO L78 Accepts]: Start accepts. Automaton has 6614 states and 23005 transitions. Word has length 4 [2022-11-18 19:55:16,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:16,251 INFO L495 AbstractCegarLoop]: Abstraction has 6614 states and 23005 transitions. [2022-11-18 19:55:16,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:55:16,252 INFO L276 IsEmpty]: Start isEmpty. Operand 6614 states and 23005 transitions. [2022-11-18 19:55:16,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 19:55:16,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:16,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 19:55:16,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:55:16,254 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:16,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:16,254 INFO L85 PathProgramCache]: Analyzing trace with hash 31600938, now seen corresponding path program 1 times [2022-11-18 19:55:16,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:16,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187054668] [2022-11-18 19:55:16,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:16,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:16,468 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:55:16,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:16,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187054668] [2022-11-18 19:55:16,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187054668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:16,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:16,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 19:55:16,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164170350] [2022-11-18 19:55:16,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:16,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:55:16,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:16,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:55:16,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:55:16,473 INFO L87 Difference]: Start difference. First operand 6614 states and 23005 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:55:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:16,602 INFO L93 Difference]: Finished difference Result 2394 states and 7373 transitions. [2022-11-18 19:55:16,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:16,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-18 19:55:16,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:16,615 INFO L225 Difference]: With dead ends: 2394 [2022-11-18 19:55:16,615 INFO L226 Difference]: Without dead ends: 2328 [2022-11-18 19:55:16,615 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:55:16,616 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:16,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:55:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2022-11-18 19:55:16,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2328. [2022-11-18 19:55:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 2262 states have (on average 3.163129973474801) internal successors, (7155), 2327 states have internal predecessors, (7155), 0 states have call successors, (0), 0 states 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:55:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 7155 transitions. [2022-11-18 19:55:16,693 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 7155 transitions. Word has length 4 [2022-11-18 19:55:16,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:16,693 INFO L495 AbstractCegarLoop]: Abstraction has 2328 states and 7155 transitions. [2022-11-18 19:55:16,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:55:16,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 7155 transitions. [2022-11-18 19:55:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 19:55:16,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:16,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:16,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:55:16,695 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:16,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:16,695 INFO L85 PathProgramCache]: Analyzing trace with hash 632604428, now seen corresponding path program 1 times [2022-11-18 19:55:16,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:16,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759493065] [2022-11-18 19:55:16,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:16,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:16,843 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:55:16,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:16,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759493065] [2022-11-18 19:55:16,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759493065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:16,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:16,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 19:55:16,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780338981] [2022-11-18 19:55:16,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:16,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:55:16,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:16,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:55:16,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:55:16,846 INFO L87 Difference]: Start difference. First operand 2328 states and 7155 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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:55:16,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:16,996 INFO L93 Difference]: Finished difference Result 2296 states and 7043 transitions. [2022-11-18 19:55:16,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:16,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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:55:16,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:17,007 INFO L225 Difference]: With dead ends: 2296 [2022-11-18 19:55:17,008 INFO L226 Difference]: Without dead ends: 2296 [2022-11-18 19:55:17,008 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:55:17,010 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:17,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:55:17,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2022-11-18 19:55:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2296. [2022-11-18 19:55:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2296 states, 2230 states have (on average 3.1582959641255606) internal successors, (7043), 2295 states have internal predecessors, (7043), 0 states have call successors, (0), 0 states 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:55:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 7043 transitions. [2022-11-18 19:55:17,095 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 7043 transitions. Word has length 10 [2022-11-18 19:55:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:17,096 INFO L495 AbstractCegarLoop]: Abstraction has 2296 states and 7043 transitions. [2022-11-18 19:55:17,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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:55:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 7043 transitions. [2022-11-18 19:55:17,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:55:17,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:17,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:17,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:55:17,099 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:17,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:17,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1864098339, now seen corresponding path program 1 times [2022-11-18 19:55:17,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:17,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525478173] [2022-11-18 19:55:17,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:17,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:17,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:55:17,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:17,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525478173] [2022-11-18 19:55:17,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525478173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:17,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:17,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:55:17,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785356278] [2022-11-18 19:55:17,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:17,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:55:17,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:17,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:55:17,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:55:17,324 INFO L87 Difference]: Start difference. First operand 2296 states and 7043 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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:55:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:17,512 INFO L93 Difference]: Finished difference Result 2636 states and 7855 transitions. [2022-11-18 19:55:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:17,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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:55:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:17,532 INFO L225 Difference]: With dead ends: 2636 [2022-11-18 19:55:17,532 INFO L226 Difference]: Without dead ends: 2636 [2022-11-18 19:55:17,532 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:55:17,533 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:17,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:55:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2022-11-18 19:55:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2232. [2022-11-18 19:55:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 2167 states have (on average 3.154130133825565) internal successors, (6835), 2231 states have internal predecessors, (6835), 0 states have call successors, (0), 0 states 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:55:17,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 6835 transitions. [2022-11-18 19:55:17,612 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 6835 transitions. Word has length 11 [2022-11-18 19:55:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:17,612 INFO L495 AbstractCegarLoop]: Abstraction has 2232 states and 6835 transitions. [2022-11-18 19:55:17,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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:55:17,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 6835 transitions. [2022-11-18 19:55:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:55:17,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:17,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:17,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:55:17,615 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:17,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:17,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1864098338, now seen corresponding path program 1 times [2022-11-18 19:55:17,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:17,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963043950] [2022-11-18 19:55:17,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:17,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:17,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:17,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:17,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963043950] [2022-11-18 19:55:17,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963043950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:17,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:17,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:55:17,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156608112] [2022-11-18 19:55:17,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:17,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:55:17,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:17,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:55:17,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:55:17,851 INFO L87 Difference]: Start difference. First operand 2232 states and 6835 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:55:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:18,004 INFO L93 Difference]: Finished difference Result 2168 states and 6627 transitions. [2022-11-18 19:55:18,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:55:18,005 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:55:18,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:18,015 INFO L225 Difference]: With dead ends: 2168 [2022-11-18 19:55:18,015 INFO L226 Difference]: Without dead ends: 2168 [2022-11-18 19:55:18,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:55:18,016 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:18,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:55:18,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2022-11-18 19:55:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2022-11-18 19:55:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 2104 states have (on average 3.1497148288973382) internal successors, (6627), 2167 states have internal predecessors, (6627), 0 states have call successors, (0), 0 states 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:55:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 6627 transitions. [2022-11-18 19:55:18,082 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 6627 transitions. Word has length 11 [2022-11-18 19:55:18,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:18,082 INFO L495 AbstractCegarLoop]: Abstraction has 2168 states and 6627 transitions. [2022-11-18 19:55:18,082 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:55:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 6627 transitions. [2022-11-18 19:55:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:55:18,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:18,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:18,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:55:18,084 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:18,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:18,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1864102661, now seen corresponding path program 1 times [2022-11-18 19:55:18,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:18,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471968521] [2022-11-18 19:55:18,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:18,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:18,374 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:55:18,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:18,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471968521] [2022-11-18 19:55:18,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471968521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:18,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:18,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 19:55:18,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178543469] [2022-11-18 19:55:18,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:18,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:55:18,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:18,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:55:18,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:55:18,376 INFO L87 Difference]: Start difference. First operand 2168 states and 6627 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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:55:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:18,518 INFO L93 Difference]: Finished difference Result 2148 states and 6556 transitions. [2022-11-18 19:55:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:18,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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:55:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:18,530 INFO L225 Difference]: With dead ends: 2148 [2022-11-18 19:55:18,530 INFO L226 Difference]: Without dead ends: 2148 [2022-11-18 19:55:18,530 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:55:18,532 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:18,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:55:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2022-11-18 19:55:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2148. [2022-11-18 19:55:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 2084 states have (on average 3.145873320537428) internal successors, (6556), 2147 states have internal predecessors, (6556), 0 states have call successors, (0), 0 states 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:55:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 6556 transitions. [2022-11-18 19:55:18,614 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 6556 transitions. Word has length 11 [2022-11-18 19:55:18,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:18,614 INFO L495 AbstractCegarLoop]: Abstraction has 2148 states and 6556 transitions. [2022-11-18 19:55:18,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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:55:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 6556 transitions. [2022-11-18 19:55:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 19:55:18,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:18,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:18,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:55:18,619 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2095839735, now seen corresponding path program 1 times [2022-11-18 19:55:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:18,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791576546] [2022-11-18 19:55:18,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:18,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:19,094 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:55:19,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:19,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791576546] [2022-11-18 19:55:19,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791576546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:19,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:19,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:55:19,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127309944] [2022-11-18 19:55:19,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:19,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:55:19,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:19,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:55:19,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:55:19,102 INFO L87 Difference]: Start difference. First operand 2148 states and 6556 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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:55:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:19,262 INFO L93 Difference]: Finished difference Result 2136 states and 6515 transitions. [2022-11-18 19:55:19,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:19,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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:55:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:19,274 INFO L225 Difference]: With dead ends: 2136 [2022-11-18 19:55:19,275 INFO L226 Difference]: Without dead ends: 2136 [2022-11-18 19:55:19,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:55:19,276 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:19,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:55:19,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2022-11-18 19:55:19,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2136. [2022-11-18 19:55:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 2072 states have (on average 3.1443050193050195) internal successors, (6515), 2135 states have internal predecessors, (6515), 0 states have call successors, (0), 0 states 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:55:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 6515 transitions. [2022-11-18 19:55:19,356 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 6515 transitions. Word has length 12 [2022-11-18 19:55:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:19,357 INFO L495 AbstractCegarLoop]: Abstraction has 2136 states and 6515 transitions. [2022-11-18 19:55:19,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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:55:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 6515 transitions. [2022-11-18 19:55:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 19:55:19,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:19,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:19,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:55:19,359 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:19,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:19,359 INFO L85 PathProgramCache]: Analyzing trace with hash 546652878, now seen corresponding path program 1 times [2022-11-18 19:55:19,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:19,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163499637] [2022-11-18 19:55:19,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:19,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:19,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:19,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163499637] [2022-11-18 19:55:19,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163499637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:19,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:19,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:55:19,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690212462] [2022-11-18 19:55:19,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:19,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:55:19,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:19,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:55:19,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:55:19,615 INFO L87 Difference]: Start difference. First operand 2136 states and 6515 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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:55:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:19,823 INFO L93 Difference]: Finished difference Result 3056 states and 9247 transitions. [2022-11-18 19:55:19,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:55:19,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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:55:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:19,839 INFO L225 Difference]: With dead ends: 3056 [2022-11-18 19:55:19,839 INFO L226 Difference]: Without dead ends: 3056 [2022-11-18 19:55:19,839 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:55:19,840 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:19,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:55:19,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2022-11-18 19:55:19,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 2232. [2022-11-18 19:55:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 2168 states have (on average 3.139760147601476) internal successors, (6807), 2231 states have internal predecessors, (6807), 0 states have call successors, (0), 0 states 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:55:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 6807 transitions. [2022-11-18 19:55:19,915 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 6807 transitions. Word has length 13 [2022-11-18 19:55:19,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:19,915 INFO L495 AbstractCegarLoop]: Abstraction has 2232 states and 6807 transitions. [2022-11-18 19:55:19,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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:55:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 6807 transitions. [2022-11-18 19:55:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 19:55:19,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:19,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:19,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 19:55:19,917 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:19,918 INFO L85 PathProgramCache]: Analyzing trace with hash -401325394, now seen corresponding path program 1 times [2022-11-18 19:55:19,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:19,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520933393] [2022-11-18 19:55:19,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:19,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:20,075 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:55:20,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:20,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520933393] [2022-11-18 19:55:20,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520933393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:20,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:20,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:55:20,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705597920] [2022-11-18 19:55:20,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:20,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:55:20,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:20,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:55:20,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:55:20,077 INFO L87 Difference]: Start difference. First operand 2232 states and 6807 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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:55:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:20,240 INFO L93 Difference]: Finished difference Result 2126 states and 6112 transitions. [2022-11-18 19:55:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:55:20,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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:55:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:20,249 INFO L225 Difference]: With dead ends: 2126 [2022-11-18 19:55:20,249 INFO L226 Difference]: Without dead ends: 2126 [2022-11-18 19:55:20,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:55:20,250 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:20,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 5 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:55:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2022-11-18 19:55:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 1866. [2022-11-18 19:55:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1802 states have (on average 3.107103218645949) internal successors, (5599), 1865 states have internal predecessors, (5599), 0 states have call successors, (0), 0 states 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:55:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 5599 transitions. [2022-11-18 19:55:20,302 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 5599 transitions. Word has length 13 [2022-11-18 19:55:20,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:20,303 INFO L495 AbstractCegarLoop]: Abstraction has 1866 states and 5599 transitions. [2022-11-18 19:55:20,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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:55:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 5599 transitions. [2022-11-18 19:55:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 19:55:20,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:20,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:20,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 19:55:20,305 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:20,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash 571863917, now seen corresponding path program 1 times [2022-11-18 19:55:20,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:20,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223231073] [2022-11-18 19:55:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:20,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:21,999 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:55:21,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:21,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223231073] [2022-11-18 19:55:22,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223231073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:22,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:22,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:55:22,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735407097] [2022-11-18 19:55:22,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:22,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:55:22,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:22,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:55:22,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:55:22,003 INFO L87 Difference]: Start difference. First operand 1866 states and 5599 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:55:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:22,618 INFO L93 Difference]: Finished difference Result 1830 states and 5488 transitions. [2022-11-18 19:55:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:55:22,619 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:55:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:22,629 INFO L225 Difference]: With dead ends: 1830 [2022-11-18 19:55:22,629 INFO L226 Difference]: Without dead ends: 1830 [2022-11-18 19:55:22,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-18 19:55:22,631 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 69 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:22,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 8 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 19:55:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2022-11-18 19:55:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1830. [2022-11-18 19:55:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1768 states have (on average 3.1040723981900453) internal successors, (5488), 1829 states have internal predecessors, (5488), 0 states have call successors, (0), 0 states 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:55:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 5488 transitions. [2022-11-18 19:55:22,698 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 5488 transitions. Word has length 14 [2022-11-18 19:55:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:22,699 INFO L495 AbstractCegarLoop]: Abstraction has 1830 states and 5488 transitions. [2022-11-18 19:55:22,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:55:22,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 5488 transitions. [2022-11-18 19:55:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 19:55:22,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:22,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:22,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 19:55:22,702 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:22,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:22,702 INFO L85 PathProgramCache]: Analyzing trace with hash 443813998, now seen corresponding path program 1 times [2022-11-18 19:55:22,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:22,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478474892] [2022-11-18 19:55:22,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:22,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:23,316 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:55:23,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:23,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478474892] [2022-11-18 19:55:23,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478474892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:23,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:23,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:55:23,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718652323] [2022-11-18 19:55:23,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:23,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:55:23,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:23,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:55:23,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:55:23,320 INFO L87 Difference]: Start difference. First operand 1830 states and 5488 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:55:23,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:23,977 INFO L93 Difference]: Finished difference Result 1395 states and 4053 transitions. [2022-11-18 19:55:23,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:55:23,978 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:55:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:23,985 INFO L225 Difference]: With dead ends: 1395 [2022-11-18 19:55:23,985 INFO L226 Difference]: Without dead ends: 1347 [2022-11-18 19:55:23,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:55:23,986 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 66 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:23,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 16 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:55:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2022-11-18 19:55:24,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1347. [2022-11-18 19:55:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1316 states have (on average 2.924772036474164) internal successors, (3849), 1346 states have internal predecessors, (3849), 0 states have call successors, (0), 0 states 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:55:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 3849 transitions. [2022-11-18 19:55:24,038 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 3849 transitions. Word has length 14 [2022-11-18 19:55:24,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:24,039 INFO L495 AbstractCegarLoop]: Abstraction has 1347 states and 3849 transitions. [2022-11-18 19:55:24,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:55:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 3849 transitions. [2022-11-18 19:55:24,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 19:55:24,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:24,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:24,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 19:55:24,041 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash 443813953, now seen corresponding path program 1 times [2022-11-18 19:55:24,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:24,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530009582] [2022-11-18 19:55:24,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:24,354 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:55:24,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:24,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530009582] [2022-11-18 19:55:24,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530009582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:24,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:24,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:55:24,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65511875] [2022-11-18 19:55:24,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:24,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:55:24,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:24,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:55:24,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:55:24,357 INFO L87 Difference]: Start difference. First operand 1347 states and 3849 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:24,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:24,606 INFO L93 Difference]: Finished difference Result 1118 states and 2956 transitions. [2022-11-18 19:55:24,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:55:24,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-18 19:55:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:24,612 INFO L225 Difference]: With dead ends: 1118 [2022-11-18 19:55:24,612 INFO L226 Difference]: Without dead ends: 1118 [2022-11-18 19:55:24,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:55:24,614 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 86 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:24,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 6 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:55:24,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2022-11-18 19:55:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 992. [2022-11-18 19:55:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 961 states have (on average 2.7991675338189386) internal successors, (2690), 991 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states 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:55:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 2690 transitions. [2022-11-18 19:55:24,650 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 2690 transitions. Word has length 14 [2022-11-18 19:55:24,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:24,652 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 2690 transitions. [2022-11-18 19:55:24,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 2690 transitions. [2022-11-18 19:55:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 19:55:24,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:24,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:24,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 19:55:24,655 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:24,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:24,656 INFO L85 PathProgramCache]: Analyzing trace with hash 547933222, now seen corresponding path program 1 times [2022-11-18 19:55:24,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:24,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429238009] [2022-11-18 19:55:24,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:24,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:27,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:27,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429238009] [2022-11-18 19:55:27,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429238009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:27,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:27,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:55:27,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226070580] [2022-11-18 19:55:27,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:27,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:55:27,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:27,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:55:27,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:55:27,066 INFO L87 Difference]: Start difference. First operand 992 states and 2690 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:55:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:27,762 INFO L93 Difference]: Finished difference Result 982 states and 2661 transitions. [2022-11-18 19:55:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:55:27,765 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:55:27,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:27,771 INFO L225 Difference]: With dead ends: 982 [2022-11-18 19:55:27,771 INFO L226 Difference]: Without dead ends: 982 [2022-11-18 19:55:27,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-11-18 19:55:27,772 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 82 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:27,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 6 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:55:27,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-11-18 19:55:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2022-11-18 19:55:27,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 952 states have (on average 2.7951680672268906) internal successors, (2661), 981 states have internal predecessors, (2661), 0 states have call successors, (0), 0 states 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:55:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 2661 transitions. [2022-11-18 19:55:27,801 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 2661 transitions. Word has length 15 [2022-11-18 19:55:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:27,802 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 2661 transitions. [2022-11-18 19:55:27,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:55:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 2661 transitions. [2022-11-18 19:55:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 19:55:27,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:27,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:27,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 19:55:27,805 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:27,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:27,805 INFO L85 PathProgramCache]: Analyzing trace with hash 547909941, now seen corresponding path program 1 times [2022-11-18 19:55:27,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:27,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230681135] [2022-11-18 19:55:27,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:27,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:27,985 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:55:27,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:27,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230681135] [2022-11-18 19:55:27,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230681135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:27,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:27,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:55:27,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585938089] [2022-11-18 19:55:27,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:27,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:55:27,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:27,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:55:27,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:55:27,988 INFO L87 Difference]: Start difference. First operand 982 states and 2661 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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:55:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:28,097 INFO L93 Difference]: Finished difference Result 536 states and 1247 transitions. [2022-11-18 19:55:28,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:28,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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:55:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:28,100 INFO L225 Difference]: With dead ends: 536 [2022-11-18 19:55:28,100 INFO L226 Difference]: Without dead ends: 536 [2022-11-18 19:55:28,100 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:55:28,101 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:28,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:55:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-11-18 19:55:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2022-11-18 19:55:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 514 states have (on average 2.4260700389105057) internal successors, (1247), 535 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states 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:55:28,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1247 transitions. [2022-11-18 19:55:28,117 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1247 transitions. Word has length 15 [2022-11-18 19:55:28,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:28,118 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 1247 transitions. [2022-11-18 19:55:28,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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:55:28,118 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1247 transitions. [2022-11-18 19:55:28,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 19:55:28,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:28,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:28,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 19:55:28,120 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:28,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:28,121 INFO L85 PathProgramCache]: Analyzing trace with hash -30508778, now seen corresponding path program 1 times [2022-11-18 19:55:28,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:28,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237187335] [2022-11-18 19:55:28,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:28,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:28,410 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:55:28,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:28,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237187335] [2022-11-18 19:55:28,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237187335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:28,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:28,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:55:28,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011622444] [2022-11-18 19:55:28,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:28,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:55:28,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:28,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:55:28,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:55:28,416 INFO L87 Difference]: Start difference. First operand 536 states and 1247 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:28,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:28,559 INFO L93 Difference]: Finished difference Result 242 states and 496 transitions. [2022-11-18 19:55:28,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:55:28,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-18 19:55:28,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:28,560 INFO L225 Difference]: With dead ends: 242 [2022-11-18 19:55:28,560 INFO L226 Difference]: Without dead ends: 242 [2022-11-18 19:55:28,561 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:55:28,561 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:28,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:55:28,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-18 19:55:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-11-18 19:55:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 234 states have (on average 2.1196581196581197) internal successors, (496), 241 states have internal predecessors, (496), 0 states have call successors, (0), 0 states 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:55:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 496 transitions. [2022-11-18 19:55:28,567 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 496 transitions. Word has length 17 [2022-11-18 19:55:28,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:28,567 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 496 transitions. [2022-11-18 19:55:28,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 496 transitions. [2022-11-18 19:55:28,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 19:55:28,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:28,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:28,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 19:55:28,569 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2075884473, now seen corresponding path program 1 times [2022-11-18 19:55:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:28,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443708222] [2022-11-18 19:55:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:28,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:28,885 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:55:28,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:28,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443708222] [2022-11-18 19:55:28,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443708222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:28,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:28,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:55:28,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714591703] [2022-11-18 19:55:28,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:28,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:55:28,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:28,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:55:28,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:55:28,888 INFO L87 Difference]: Start difference. First operand 242 states and 496 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:55:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:29,010 INFO L93 Difference]: Finished difference Result 173 states and 381 transitions. [2022-11-18 19:55:29,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:55:29,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-11-18 19:55:29,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:29,012 INFO L225 Difference]: With dead ends: 173 [2022-11-18 19:55:29,012 INFO L226 Difference]: Without dead ends: 76 [2022-11-18 19:55:29,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:55:29,013 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:29,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:55:29,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-18 19:55:29,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-18 19:55:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.96) internal successors, (147), 75 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:55:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 147 transitions. [2022-11-18 19:55:29,016 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 147 transitions. Word has length 19 [2022-11-18 19:55:29,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:29,016 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 147 transitions. [2022-11-18 19:55:29,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:55:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 147 transitions. [2022-11-18 19:55:29,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 19:55:29,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:29,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:29,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 19:55:29,017 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:55:29,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:29,018 INFO L85 PathProgramCache]: Analyzing trace with hash -704343320, now seen corresponding path program 1 times [2022-11-18 19:55:29,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:29,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422809672] [2022-11-18 19:55:29,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:29,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:55:29,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:55:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:55:29,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 19:55:29,336 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:55:29,337 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2022-11-18 19:55:29,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2022-11-18 19:55:29,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2022-11-18 19:55:29,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2022-11-18 19:55:29,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2022-11-18 19:55:29,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2022-11-18 19:55:29,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2022-11-18 19:55:29,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2022-11-18 19:55:29,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2022-11-18 19:55:29,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2022-11-18 19:55:29,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2022-11-18 19:55:29,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2022-11-18 19:55:29,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2022-11-18 19:55:29,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2022-11-18 19:55:29,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2022-11-18 19:55:29,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2022-11-18 19:55:29,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2022-11-18 19:55:29,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2022-11-18 19:55:29,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2022-11-18 19:55:29,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2022-11-18 19:55:29,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2022-11-18 19:55:29,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2022-11-18 19:55:29,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2022-11-18 19:55:29,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2022-11-18 19:55:29,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2022-11-18 19:55:29,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2022-11-18 19:55:29,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2022-11-18 19:55:29,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2022-11-18 19:55:29,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2022-11-18 19:55:29,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2022-11-18 19:55:29,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2022-11-18 19:55:29,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2022-11-18 19:55:29,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2022-11-18 19:55:29,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2022-11-18 19:55:29,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2022-11-18 19:55:29,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2022-11-18 19:55:29,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2022-11-18 19:55:29,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2022-11-18 19:55:29,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2022-11-18 19:55:29,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2022-11-18 19:55:29,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2022-11-18 19:55:29,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2022-11-18 19:55:29,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2022-11-18 19:55:29,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2022-11-18 19:55:29,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2022-11-18 19:55:29,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2022-11-18 19:55:29,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2022-11-18 19:55:29,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2022-11-18 19:55:29,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2022-11-18 19:55:29,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2022-11-18 19:55:29,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2022-11-18 19:55:29,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2022-11-18 19:55:29,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2022-11-18 19:55:29,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2022-11-18 19:55:29,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2022-11-18 19:55:29,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2022-11-18 19:55:29,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2022-11-18 19:55:29,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2022-11-18 19:55:29,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2022-11-18 19:55:29,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2022-11-18 19:55:29,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2022-11-18 19:55:29,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2022-11-18 19:55:29,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2022-11-18 19:55:29,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2022-11-18 19:55:29,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2022-11-18 19:55:29,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2022-11-18 19:55:29,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2022-11-18 19:55:29,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2022-11-18 19:55:29,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2022-11-18 19:55:29,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2022-11-18 19:55:29,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2022-11-18 19:55:29,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2022-11-18 19:55:29,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2022-11-18 19:55:29,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2022-11-18 19:55:29,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2022-11-18 19:55:29,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2022-11-18 19:55:29,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2022-11-18 19:55:29,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2022-11-18 19:55:29,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2022-11-18 19:55:29,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2022-11-18 19:55:29,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2022-11-18 19:55:29,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2022-11-18 19:55:29,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2022-11-18 19:55:29,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2022-11-18 19:55:29,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2022-11-18 19:55:29,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 19:55:29,369 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:29,377 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 19:55:29,377 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:55:29,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:55:29 BasicIcfg [2022-11-18 19:55:29,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:55:29,522 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:55:29,522 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:55:29,523 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:55:29,523 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:54:55" (3/4) ... [2022-11-18 19:55:29,530 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 19:55:29,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:55:29,531 INFO L158 Benchmark]: Toolchain (without parser) took 36135.14ms. Allocated memory was 107.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 62.5MB in the beginning and 501.5MB in the end (delta: -439.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-18 19:55:29,532 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 107.0MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:55:29,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 706.00ms. Allocated memory is still 107.0MB. Free memory was 62.3MB in the beginning and 67.1MB in the end (delta: -4.9MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-11-18 19:55:29,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.13ms. Allocated memory is still 107.0MB. Free memory was 67.1MB in the beginning and 64.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:55:29,533 INFO L158 Benchmark]: Boogie Preprocessor took 45.37ms. Allocated memory is still 107.0MB. Free memory was 64.7MB in the beginning and 62.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:55:29,534 INFO L158 Benchmark]: RCFGBuilder took 1495.60ms. Allocated memory was 107.0MB in the beginning and 146.8MB in the end (delta: 39.8MB). Free memory was 62.2MB in the beginning and 84.0MB in the end (delta: -21.8MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-11-18 19:55:29,534 INFO L158 Benchmark]: TraceAbstraction took 33784.25ms. Allocated memory was 146.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 84.0MB in the beginning and 501.5MB in the end (delta: -417.5MB). Peak memory consumption was 982.3MB. Max. memory is 16.1GB. [2022-11-18 19:55:29,534 INFO L158 Benchmark]: Witness Printer took 7.70ms. Allocated memory is still 1.5GB. Free memory is still 501.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:55:29,539 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.28ms. Allocated memory is still 107.0MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 706.00ms. Allocated memory is still 107.0MB. Free memory was 62.3MB in the beginning and 67.1MB in the end (delta: -4.9MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.13ms. Allocated memory is still 107.0MB. Free memory was 67.1MB in the beginning and 64.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.37ms. Allocated memory is still 107.0MB. Free memory was 64.7MB in the beginning and 62.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1495.60ms. Allocated memory was 107.0MB in the beginning and 146.8MB in the end (delta: 39.8MB). Free memory was 62.2MB in the beginning and 84.0MB in the end (delta: -21.8MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 33784.25ms. Allocated memory was 146.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 84.0MB in the beginning and 501.5MB in the end (delta: -417.5MB). Peak memory consumption was 982.3MB. Max. memory is 16.1GB. * Witness Printer took 7.70ms. Allocated memory is still 1.5GB. Free memory is still 501.5MB. 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: 15.6s, 189 PlacesBefore, 85 PlacesAfterwards, 181 TransitionsBefore, 76 TransitionsAfterwards, 7128 CoEnabledTransitionPairs, 7 FixpointIterations, 73 TrivialSequentialCompositions, 93 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 171 TotalNumberOfCompositions, 26031 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10478, independent: 10054, independent conditional: 0, independent unconditional: 10054, dependent: 350, dependent conditional: 0, dependent unconditional: 350, unknown: 74, unknown conditional: 0, unknown unconditional: 74] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4643, independent: 4563, independent conditional: 0, independent unconditional: 4563, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4643, independent: 3986, independent conditional: 0, independent unconditional: 3986, dependent: 657, dependent conditional: 0, dependent unconditional: 657, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 657, independent: 577, independent conditional: 0, independent unconditional: 577, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2601, independent: 1984, independent conditional: 0, independent unconditional: 1984, dependent: 420, dependent conditional: 0, dependent unconditional: 420, unknown: 197, unknown conditional: 0, unknown unconditional: 197] ], Cache Queries: [ total: 10478, independent: 5491, independent conditional: 0, independent unconditional: 5491, dependent: 279, dependent conditional: 0, dependent unconditional: 279, unknown: 4708, unknown conditional: 0, unknown unconditional: 4708] , Statistics on independence cache: Total cache size (in pairs): 667, Positive cache size: 637, Positive conditional cache size: 0, Positive unconditional cache size: 637, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 8, Unknown conditional cache size: 0, Unknown unconditional cache size: 8 - 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: [L737] 0 _Bool x$flush_delayed; [L748] 0 int *x$read_delayed_var; [L742] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L739] 0 _Bool x$r_buff0_thd0; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L747] 0 _Bool x$read_delayed; [L710] 0 int __unbuffered_cnt = 0; [L752] 0 _Bool x$w_buff1_used; [L749] 0 int x$w_buff0; [L751] 0 int x$w_buff1; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L738] 0 int x$mem_tmp; [L712] 0 int __unbuffered_p0_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L734] 0 _Bool main$tmp_guard1; [L733] 0 _Bool main$tmp_guard0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L750] 0 _Bool x$w_buff0_used; [L736] 0 int x = 0; [L744] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd0; [L754] 0 int y = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L746] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$r_buff1_thd2; [L849] 0 pthread_t t2216; [L850] FCALL, FORK 0 pthread_create(&t2216, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2216, ((void *)0), P0, ((void *)0))=-3, t2216={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2217; [L852] FCALL, FORK 0 pthread_create(&t2217, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2217, ((void *)0), P1, ((void *)0))=-2, t2216={7:0}, t2217={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2218; [L854] FCALL, FORK 0 pthread_create(&t2218, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2218, ((void *)0), P2, ((void *)0))=-1, t2216={7:0}, t2217={5:0}, t2218={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 \read(x) [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L789] 2 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2216={7:0}, t2217={5:0}, t2218={6:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L871] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - 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: -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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 854]: 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: 852]: 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 7 procedures, 239 locations, 85 error locations. Started 1 CEGAR loops. OverallTime: 33.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 654 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 654 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1732 IncrementalHoareTripleChecker+Invalid, 1894 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 19 mSDtfsCounter, 1732 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51276occurred in iteration=0, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 2502 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 2325 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:55:29,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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_97079215-39f9-442a-92cb-8d9a89a08696/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 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 --- 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:32,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:55:32,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:55:32,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:55:32,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:55:32,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:55:32,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:55:32,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:55:32,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:55:32,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:55:32,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:55:32,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:55:32,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:55:32,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:55:32,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:55:32,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:55:32,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:55:32,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:55:32,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:55:32,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:55:32,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:55:32,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:55:32,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:55:32,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:55:32,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:55:32,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:55:32,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:55:32,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:55:32,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:55:32,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:55:32,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:55:32,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:55:32,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:55:32,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:55:32,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:55:32,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:55:32,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:55:32,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:55:32,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:55:32,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:55:32,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:55:32,202 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-18 19:55:32,246 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:55:32,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:55:32,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:55:32,251 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:55:32,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:55:32,253 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:55:32,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:55:32,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:55:32,255 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:55:32,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:55:32,257 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:55:32,257 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 19:55:32,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:55:32,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:55:32,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:55:32,259 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 19:55:32,259 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 19:55:32,259 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 19:55:32,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:55:32,260 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 19:55:32,260 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 19:55:32,260 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 19:55:32,260 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:55:32,261 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:55:32,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:55:32,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:55:32,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:55:32,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:55:32,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:55:32,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:55:32,263 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 19:55:32,263 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 19:55:32,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 19:55:32,264 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_97079215-39f9-442a-92cb-8d9a89a08696/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_97079215-39f9-442a-92cb-8d9a89a08696/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 -> 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 [2022-11-18 19:55:32,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:55:32,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:55:32,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:55:32,728 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:55:32,729 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:55:32,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-11-18 19:55:32,834 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/data/78f405c89/a72c588e255e4f8391701d708f63f770/FLAG1db92b7ac [2022-11-18 19:55:33,577 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:55:33,578 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-11-18 19:55:33,592 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/data/78f405c89/a72c588e255e4f8391701d708f63f770/FLAG1db92b7ac [2022-11-18 19:55:33,871 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/data/78f405c89/a72c588e255e4f8391701d708f63f770 [2022-11-18 19:55:33,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:55:33,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:55:33,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:55:33,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:55:33,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:55:33,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:55:33" (1/1) ... [2022-11-18 19:55:33,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268e78ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:33, skipping insertion in model container [2022-11-18 19:55:33,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:55:33" (1/1) ... [2022-11-18 19:55:33,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:55:33,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:55:34,232 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_97079215-39f9-442a-92cb-8d9a89a08696/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-11-18 19:55:34,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:55:34,637 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:55:34,659 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_97079215-39f9-442a-92cb-8d9a89a08696/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-11-18 19:55:34,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:55:34,808 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:55:34,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:34 WrapperNode [2022-11-18 19:55:34,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:55:34,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:55:34,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:55:34,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:55:34,820 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:34" (1/1) ... [2022-11-18 19:55:34,867 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:34" (1/1) ... [2022-11-18 19:55:34,915 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-11-18 19:55:34,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:55:34,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:55:34,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:55:34,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:55:34,928 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:34" (1/1) ... [2022-11-18 19:55:34,929 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:34" (1/1) ... [2022-11-18 19:55:34,934 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:34" (1/1) ... [2022-11-18 19:55:34,935 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:34" (1/1) ... [2022-11-18 19:55:34,945 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:34" (1/1) ... [2022-11-18 19:55:34,952 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:34" (1/1) ... [2022-11-18 19:55:34,956 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:34" (1/1) ... [2022-11-18 19:55:34,958 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:34" (1/1) ... [2022-11-18 19:55:34,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:55:34,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:55:34,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:55:34,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:55:34,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:34" (1/1) ... [2022-11-18 19:55:34,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:55:35,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:35,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-18 19:55:35,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 19:55:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:55:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:55:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:55:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 19:55:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 19:55:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-18 19:55:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 19:55:35,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 19:55:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 19:55:35,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 19:55:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 19:55:35,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 19:55:35,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 19:55:35,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:55:35,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:55:35,107 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:35,296 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:55:35,299 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:55:36,243 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:55:36,835 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:55:36,835 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:55:36,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:55:36 BoogieIcfgContainer [2022-11-18 19:55:36,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:55:36,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:55:36,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:55:36,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:55:36,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:55:33" (1/3) ... [2022-11-18 19:55:36,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d4a587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:55:36, skipping insertion in model container [2022-11-18 19:55:36,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:34" (2/3) ... [2022-11-18 19:55:36,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d4a587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:55:36, skipping insertion in model container [2022-11-18 19:55:36,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:55:36" (3/3) ... [2022-11-18 19:55:36,850 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.opt.i [2022-11-18 19:55:36,873 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:55:36,874 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2022-11-18 19:55:36,874 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:55:37,096 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 19:55:37,150 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 19:55:37,171 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 182 transitions, 379 flow [2022-11-18 19:55:37,177 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 182 transitions, 379 flow [2022-11-18 19:55:37,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 182 transitions, 379 flow [2022-11-18 19:55:37,320 INFO L130 PetriNetUnfolder]: 2/179 cut-off events. [2022-11-18 19:55:37,321 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:55:37,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 179 events. 2/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 254 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-11-18 19:55:37,342 INFO L119 LiptonReduction]: Number of co-enabled transitions 7128 [2022-11-18 19:56:10,212 INFO L134 LiptonReduction]: Checked pairs total: 29135 [2022-11-18 19:56:10,212 INFO L136 LiptonReduction]: Total number of compositions: 169 [2022-11-18 19:56:10,223 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 76 transitions, 167 flow [2022-11-18 19:56:12,485 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 0 states 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,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:56:12,541 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;@5a9d408b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:56:12,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-11-18 19:56:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 0 states 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,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 19:56:12,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:12,675 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 19:56:12,678 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:56:12,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:12,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1033, now seen corresponding path program 1 times [2022-11-18 19:56:12,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:12,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960722475] [2022-11-18 19:56:12,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:12,707 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:56:12,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:12,716 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:12,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:12,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 19:56:12,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:12,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:12,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:12,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960722475] [2022-11-18 19:56:12,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960722475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:12,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:12,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 19:56:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473683819] [2022-11-18 19:56:12,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:12,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:56:12,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:12,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:56:12,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:56:13,293 INFO L87 Difference]: Start difference. First operand has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 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:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:13,897 INFO L93 Difference]: Finished difference Result 10092 states and 35895 transitions. [2022-11-18 19:56:13,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:56:13,900 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:13,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:14,202 INFO L225 Difference]: With dead ends: 10092 [2022-11-18 19:56:14,202 INFO L226 Difference]: Without dead ends: 10092 [2022-11-18 19:56:14,203 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:14,216 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:14,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:56:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10092 states. [2022-11-18 19:56:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10092 to 10092. [2022-11-18 19:56:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10092 states, 8770 states have (on average 4.092930444697833) internal successors, (35895), 10091 states have internal predecessors, (35895), 0 states have call successors, (0), 0 states 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,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10092 states to 10092 states and 35895 transitions. [2022-11-18 19:56:15,238 INFO L78 Accepts]: Start accepts. Automaton has 10092 states and 35895 transitions. Word has length 1 [2022-11-18 19:56:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:15,238 INFO L495 AbstractCegarLoop]: Abstraction has 10092 states and 35895 transitions. [2022-11-18 19:56:15,238 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:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 10092 states and 35895 transitions. [2022-11-18 19:56:15,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 19:56:15,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:15,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 19:56:15,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:15,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:15,453 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:56:15,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:15,453 INFO L85 PathProgramCache]: Analyzing trace with hash 31573132, now seen corresponding path program 1 times [2022-11-18 19:56:15,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:15,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839482397] [2022-11-18 19:56:15,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:15,455 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:56:15,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:15,460 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:15,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:15,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:56:15,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:15,739 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:56:15,742 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:56:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:15,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:15,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:15,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839482397] [2022-11-18 19:56:15,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839482397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:15,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:15,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 19:56:15,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186151382] [2022-11-18 19:56:15,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:15,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:56:15,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:15,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:56:15,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:15,806 INFO L87 Difference]: Start difference. First operand 10092 states and 35895 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:16,207 INFO L93 Difference]: Finished difference Result 5274 states and 18133 transitions. [2022-11-18 19:56:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:56:16,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-18 19:56:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:16,271 INFO L225 Difference]: With dead ends: 5274 [2022-11-18 19:56:16,272 INFO L226 Difference]: Without dead ends: 5274 [2022-11-18 19:56:16,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:16,274 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:16,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:56:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5274 states. [2022-11-18 19:56:16,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5274 to 5274. [2022-11-18 19:56:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5274 states, 4821 states have (on average 3.7612528521053723) internal successors, (18133), 5273 states have internal predecessors, (18133), 0 states have call successors, (0), 0 states 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,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5274 states to 5274 states and 18133 transitions. [2022-11-18 19:56:16,607 INFO L78 Accepts]: Start accepts. Automaton has 5274 states and 18133 transitions. Word has length 4 [2022-11-18 19:56:16,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:16,608 INFO L495 AbstractCegarLoop]: Abstraction has 5274 states and 18133 transitions. [2022-11-18 19:56:16,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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,609 INFO L276 IsEmpty]: Start isEmpty. Operand 5274 states and 18133 transitions. [2022-11-18 19:56:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 19:56:16,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:16,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 19:56:16,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:16,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:16,827 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:56:16,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:16,828 INFO L85 PathProgramCache]: Analyzing trace with hash 31573133, now seen corresponding path program 1 times [2022-11-18 19:56:16,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:16,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445728621] [2022-11-18 19:56:16,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:16,830 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:56:16,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:16,831 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:16,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:17,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 19:56:17,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:17,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:56:17,041 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:56:17,082 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,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:17,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:17,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445728621] [2022-11-18 19:56:17,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445728621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:17,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:17,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 19:56:17,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541842273] [2022-11-18 19:56:17,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:17,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:56:17,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:17,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:56:17,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:17,085 INFO L87 Difference]: Start difference. First operand 5274 states and 18133 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:17,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:17,292 INFO L93 Difference]: Finished difference Result 1734 states and 5635 transitions. [2022-11-18 19:56:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:56:17,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-18 19:56:17,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:17,304 INFO L225 Difference]: With dead ends: 1734 [2022-11-18 19:56:17,304 INFO L226 Difference]: Without dead ends: 1734 [2022-11-18 19:56:17,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:17,306 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:17,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:56:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2022-11-18 19:56:17,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1734. [2022-11-18 19:56:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1668 states have (on average 3.378297362110312) internal successors, (5635), 1733 states have internal predecessors, (5635), 0 states have call successors, (0), 0 states 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:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 5635 transitions. [2022-11-18 19:56:17,373 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 5635 transitions. Word has length 4 [2022-11-18 19:56:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:17,373 INFO L495 AbstractCegarLoop]: Abstraction has 1734 states and 5635 transitions. [2022-11-18 19:56:17,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 5635 transitions. [2022-11-18 19:56:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 19:56:17,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:17,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:17,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:17,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:17,589 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:56:17,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:17,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1630062998, now seen corresponding path program 1 times [2022-11-18 19:56:17,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:17,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326715966] [2022-11-18 19:56:17,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:17,590 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:56:17,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:17,591 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:17,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:17,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:56:17,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:17,915 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,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:17,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:17,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326715966] [2022-11-18 19:56:17,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326715966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:17,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:17,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:56:17,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645540845] [2022-11-18 19:56:17,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:17,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:56:17,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:17,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:56:17,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:56:17,920 INFO L87 Difference]: Start difference. First operand 1734 states and 5635 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:18,196 INFO L93 Difference]: Finished difference Result 847 states and 2222 transitions. [2022-11-18 19:56:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:56:18,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:18,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:18,205 INFO L225 Difference]: With dead ends: 847 [2022-11-18 19:56:18,205 INFO L226 Difference]: Without dead ends: 847 [2022-11-18 19:56:18,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:18,207 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:18,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:56:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2022-11-18 19:56:18,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2022-11-18 19:56:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 799 states have (on average 2.780976220275344) internal successors, (2222), 846 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states 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,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 2222 transitions. [2022-11-18 19:56:18,242 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 2222 transitions. Word has length 10 [2022-11-18 19:56:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:18,243 INFO L495 AbstractCegarLoop]: Abstraction has 847 states and 2222 transitions. [2022-11-18 19:56:18,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 2222 transitions. [2022-11-18 19:56:18,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 19:56:18,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:18,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:18,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:18,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:18,460 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:56:18,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:18,461 INFO L85 PathProgramCache]: Analyzing trace with hash 34046063, now seen corresponding path program 1 times [2022-11-18 19:56:18,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:18,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853523308] [2022-11-18 19:56:18,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:18,462 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:56:18,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:18,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:18,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:18,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:56:18,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:18,761 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,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:18,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:18,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853523308] [2022-11-18 19:56:18,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853523308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:18,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:18,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:56:18,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653478534] [2022-11-18 19:56:18,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:18,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:56:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:18,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:56:18,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:56:18,764 INFO L87 Difference]: Start difference. First operand 847 states and 2222 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:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:19,085 INFO L93 Difference]: Finished difference Result 276 states and 576 transitions. [2022-11-18 19:56:19,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:56:19,086 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:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:19,087 INFO L225 Difference]: With dead ends: 276 [2022-11-18 19:56:19,087 INFO L226 Difference]: Without dead ends: 276 [2022-11-18 19:56:19,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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:56:19,088 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:19,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:56:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-11-18 19:56:19,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2022-11-18 19:56:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 258 states have (on average 2.2325581395348837) internal successors, (576), 275 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 576 transitions. [2022-11-18 19:56:19,097 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 576 transitions. Word has length 13 [2022-11-18 19:56:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:19,098 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 576 transitions. [2022-11-18 19:56:19,098 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:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 576 transitions. [2022-11-18 19:56:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 19:56:19,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:19,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:19,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:19,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:19,321 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:56:19,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:19,322 INFO L85 PathProgramCache]: Analyzing trace with hash 60800488, now seen corresponding path program 1 times [2022-11-18 19:56:19,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:19,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877070718] [2022-11-18 19:56:19,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:19,322 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:56:19,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:19,323 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:19,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:19,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 19:56:19,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:19,609 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,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:19,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:19,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877070718] [2022-11-18 19:56:19,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877070718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:19,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:19,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:56:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847911059] [2022-11-18 19:56:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:19,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:56:19,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:19,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:56:19,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:56:19,612 INFO L87 Difference]: Start difference. First operand 276 states and 576 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:20,098 INFO L93 Difference]: Finished difference Result 151 states and 336 transitions. [2022-11-18 19:56:20,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:56:20,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-18 19:56:20,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:20,100 INFO L225 Difference]: With dead ends: 151 [2022-11-18 19:56:20,100 INFO L226 Difference]: Without dead ends: 151 [2022-11-18 19:56:20,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:20,101 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:20,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:56:20,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-18 19:56:20,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-18 19:56:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 2.2857142857142856) internal successors, (336), 150 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 336 transitions. [2022-11-18 19:56:20,106 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 336 transitions. Word has length 16 [2022-11-18 19:56:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:20,106 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 336 transitions. [2022-11-18 19:56:20,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 336 transitions. [2022-11-18 19:56:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 19:56:20,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:20,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:20,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:20,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:20,308 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:56:20,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:20,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1548620748, now seen corresponding path program 1 times [2022-11-18 19:56:20,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:20,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95212675] [2022-11-18 19:56:20,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:20,310 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:56:20,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:20,311 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:20,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:20,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:56:20,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:20,736 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:56:20,798 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,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:20,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:20,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95212675] [2022-11-18 19:56:20,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95212675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:20,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:20,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:56:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596304926] [2022-11-18 19:56:20,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:20,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:56:20,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:20,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:56:20,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:56:20,802 INFO L87 Difference]: Start difference. First operand 151 states and 336 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:21,136 INFO L93 Difference]: Finished difference Result 150 states and 335 transitions. [2022-11-18 19:56:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:56:21,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-18 19:56:21,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:21,138 INFO L225 Difference]: With dead ends: 150 [2022-11-18 19:56:21,138 INFO L226 Difference]: Without dead ends: 150 [2022-11-18 19:56:21,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:56:21,140 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:21,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:56:21,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-18 19:56:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-18 19:56:21,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 147 states have (on average 2.2789115646258504) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 335 transitions. [2022-11-18 19:56:21,150 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 335 transitions. Word has length 20 [2022-11-18 19:56:21,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:21,152 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 335 transitions. [2022-11-18 19:56:21,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 335 transitions. [2022-11-18 19:56:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 19:56:21,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:21,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:21,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:21,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:21,395 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:56:21,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:21,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1548620749, now seen corresponding path program 1 times [2022-11-18 19:56:21,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:21,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243790560] [2022-11-18 19:56:21,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:21,397 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:56:21,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:21,411 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:21,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:21,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 19:56:21,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:21,922 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:56:22,038 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:22,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:22,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:22,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243790560] [2022-11-18 19:56:22,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243790560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:22,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:22,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:56:22,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806130627] [2022-11-18 19:56:22,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:22,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:56:22,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:22,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:56:22,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:56:22,041 INFO L87 Difference]: Start difference. First operand 150 states and 335 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:22,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:22,295 INFO L93 Difference]: Finished difference Result 149 states and 334 transitions. [2022-11-18 19:56:22,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:56:22,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-18 19:56:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:22,296 INFO L225 Difference]: With dead ends: 149 [2022-11-18 19:56:22,297 INFO L226 Difference]: Without dead ends: 149 [2022-11-18 19:56:22,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:56:22,298 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:22,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:56:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-18 19:56:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-18 19:56:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 2.272108843537415) internal successors, (334), 148 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 334 transitions. [2022-11-18 19:56:22,305 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 334 transitions. Word has length 20 [2022-11-18 19:56:22,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:22,305 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 334 transitions. [2022-11-18 19:56:22,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 334 transitions. [2022-11-18 19:56:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 19:56:22,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:22,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:22,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:22,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:22,523 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:56:22,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:22,523 INFO L85 PathProgramCache]: Analyzing trace with hash 762599476, now seen corresponding path program 1 times [2022-11-18 19:56:22,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:22,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780083784] [2022-11-18 19:56:22,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:22,525 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:56:22,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:22,526 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:22,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:22,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:56:22,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:22,875 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:22,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:22,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:22,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780083784] [2022-11-18 19:56:22,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780083784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:22,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:22,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:56:22,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263506995] [2022-11-18 19:56:22,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:22,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:56:22,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:22,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:56:22,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:56:22,878 INFO L87 Difference]: Start difference. First operand 149 states and 334 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:23,093 INFO L93 Difference]: Finished difference Result 191 states and 415 transitions. [2022-11-18 19:56:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:56:23,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-18 19:56:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:23,095 INFO L225 Difference]: With dead ends: 191 [2022-11-18 19:56:23,095 INFO L226 Difference]: Without dead ends: 191 [2022-11-18 19:56:23,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:23,096 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:23,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:56:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-18 19:56:23,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2022-11-18 19:56:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 185 states have (on average 2.227027027027027) internal successors, (412), 186 states have internal predecessors, (412), 0 states have call successors, (0), 0 states 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:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 412 transitions. [2022-11-18 19:56:23,106 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 412 transitions. Word has length 21 [2022-11-18 19:56:23,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:23,106 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 412 transitions. [2022-11-18 19:56:23,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:23,107 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 412 transitions. [2022-11-18 19:56:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 19:56:23,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:23,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:23,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:23,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:23,323 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:56:23,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:23,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1925169850, now seen corresponding path program 2 times [2022-11-18 19:56:23,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:23,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109853694] [2022-11-18 19:56:23,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:56:23,324 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:56:23,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:23,325 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:23,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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 (11)] Waiting until timeout for monitored process [2022-11-18 19:56:23,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 19:56:23,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:56:23,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 19:56:23,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:24,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 33 [2022-11-18 19:56:24,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 56 treesize of output 36 [2022-11-18 19:56:24,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 86 treesize of output 74 [2022-11-18 19:56:25,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2022-11-18 19:56:25,607 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:25,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:25,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:25,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109853694] [2022-11-18 19:56:25,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109853694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:25,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:25,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:56:25,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639262401] [2022-11-18 19:56:25,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:25,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:56:25,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:25,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:56:25,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:56:25,609 INFO L87 Difference]: Start difference. First operand 187 states and 412 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:26,617 INFO L93 Difference]: Finished difference Result 337 states and 701 transitions. [2022-11-18 19:56:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:56:26,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-18 19:56:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:26,619 INFO L225 Difference]: With dead ends: 337 [2022-11-18 19:56:26,619 INFO L226 Difference]: Without dead ends: 337 [2022-11-18 19:56:26,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:56:26,621 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:26,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 7 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 19:56:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-11-18 19:56:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 202. [2022-11-18 19:56:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 200 states have (on average 2.245) internal successors, (449), 201 states have internal predecessors, (449), 0 states have call successors, (0), 0 states 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:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 449 transitions. [2022-11-18 19:56:26,629 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 449 transitions. Word has length 21 [2022-11-18 19:56:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:26,629 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 449 transitions. [2022-11-18 19:56:26,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 449 transitions. [2022-11-18 19:56:26,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 19:56:26,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:26,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:26,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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 (11)] Forceful destruction successful, exit code 0 [2022-11-18 19:56:26,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:26,847 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:56:26,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:26,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1957094272, now seen corresponding path program 3 times [2022-11-18 19:56:26,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:26,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886470644] [2022-11-18 19:56:26,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 19:56:26,849 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:56:26,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:26,850 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:26,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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 (12)] Waiting until timeout for monitored process [2022-11-18 19:56:27,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-18 19:56:27,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:56:27,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-18 19:56:27,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:27,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 33 [2022-11-18 19:56:27,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2022-11-18 19:56:28,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 56 treesize of output 36 [2022-11-18 19:56:28,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 56 treesize of output 44 [2022-11-18 19:56:29,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2022-11-18 19:56:29,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:29,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:29,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:29,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886470644] [2022-11-18 19:56:29,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886470644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:29,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:29,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:56:29,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012763687] [2022-11-18 19:56:29,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:29,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:56:29,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:29,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:56:29,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:56:29,206 INFO L87 Difference]: Start difference. First operand 202 states and 449 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:30,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:30,060 INFO L93 Difference]: Finished difference Result 307 states and 652 transitions. [2022-11-18 19:56:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:56:30,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-18 19:56:30,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:30,062 INFO L225 Difference]: With dead ends: 307 [2022-11-18 19:56:30,062 INFO L226 Difference]: Without dead ends: 307 [2022-11-18 19:56:30,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:56:30,063 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 41 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:30,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 5 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:56:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-11-18 19:56:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 199. [2022-11-18 19:56:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.238578680203046) internal successors, (441), 198 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 441 transitions. [2022-11-18 19:56:30,072 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 441 transitions. Word has length 21 [2022-11-18 19:56:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:30,072 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 441 transitions. [2022-11-18 19:56:30,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 441 transitions. [2022-11-18 19:56:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 19:56:30,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:30,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:30,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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 (12)] Forceful destruction successful, exit code 0 [2022-11-18 19:56:30,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:30,287 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:56:30,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:30,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1904520220, now seen corresponding path program 4 times [2022-11-18 19:56:30,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:30,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068048331] [2022-11-18 19:56:30,288 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 19:56:30,288 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:56:30,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:30,289 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:30,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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 (13)] Waiting until timeout for monitored process [2022-11-18 19:56:30,551 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 19:56:30,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:56:30,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 19:56:30,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:30,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 19:56:30,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2022-11-18 19:56:31,002 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 15 treesize of output 7 [2022-11-18 19:56:31,037 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:31,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:31,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:31,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068048331] [2022-11-18 19:56:31,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068048331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:31,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:31,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:56:31,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117953695] [2022-11-18 19:56:31,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:31,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:56:31,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:31,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:56:31,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:56:31,040 INFO L87 Difference]: Start difference. First operand 199 states and 441 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:31,638 INFO L93 Difference]: Finished difference Result 409 states and 860 transitions. [2022-11-18 19:56:31,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:56:31,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-18 19:56:31,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:31,640 INFO L225 Difference]: With dead ends: 409 [2022-11-18 19:56:31,640 INFO L226 Difference]: Without dead ends: 409 [2022-11-18 19:56:31,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:56:31,641 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:31,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 10 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:56:31,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-18 19:56:31,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 199. [2022-11-18 19:56:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.238578680203046) internal successors, (441), 198 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 441 transitions. [2022-11-18 19:56:31,651 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 441 transitions. Word has length 21 [2022-11-18 19:56:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:31,651 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 441 transitions. [2022-11-18 19:56:31,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:31,652 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 441 transitions. [2022-11-18 19:56:31,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 19:56:31,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:31,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:31,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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 (13)] Forceful destruction successful, exit code 0 [2022-11-18 19:56:31,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:31,866 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:56:31,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash 931473658, now seen corresponding path program 5 times [2022-11-18 19:56:31,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:31,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930814763] [2022-11-18 19:56:31,867 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 19:56:31,867 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:56:31,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:31,868 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:31,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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 (14)] Waiting until timeout for monitored process [2022-11-18 19:56:32,102 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 19:56:32,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:56:32,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-18 19:56:32,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:32,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 19:56:32,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2022-11-18 19:56:32,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2022-11-18 19:56:32,710 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 15 treesize of output 7 [2022-11-18 19:56:32,744 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:32,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:56:32,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:56:32,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930814763] [2022-11-18 19:56:32,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930814763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:56:32,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:56:32,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:56:32,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140468731] [2022-11-18 19:56:32,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:56:32,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:56:32,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:56:32,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:56:32,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:56:32,747 INFO L87 Difference]: Start difference. First operand 199 states and 441 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:56:33,459 INFO L93 Difference]: Finished difference Result 377 states and 806 transitions. [2022-11-18 19:56:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:56:33,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-18 19:56:33,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:56:33,461 INFO L225 Difference]: With dead ends: 377 [2022-11-18 19:56:33,461 INFO L226 Difference]: Without dead ends: 377 [2022-11-18 19:56:33,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:56:33,462 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 40 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:56:33,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 12 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:56:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-18 19:56:33,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 178. [2022-11-18 19:56:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 176 states have (on average 2.221590909090909) internal successors, (391), 177 states have internal predecessors, (391), 0 states have call successors, (0), 0 states 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:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 391 transitions. [2022-11-18 19:56:33,469 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 391 transitions. Word has length 21 [2022-11-18 19:56:33,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:56:33,469 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 391 transitions. [2022-11-18 19:56:33,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:56:33,469 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 391 transitions. [2022-11-18 19:56:33,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 19:56:33,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:56:33,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:33,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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 (14)] Ended with exit code 0 [2022-11-18 19:56:33,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:33,688 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 19:56:33,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:33,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1219343850, now seen corresponding path program 6 times [2022-11-18 19:56:33,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:56:33,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742900704] [2022-11-18 19:56:33,689 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 19:56:33,689 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:56:33,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:56:33,690 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:33,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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 (15)] Waiting until timeout for monitored process [2022-11-18 19:56:33,980 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-11-18 19:56:33,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 19:56:33,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:56:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:56:34,201 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-18 19:56:34,202 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:56:34,203 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2022-11-18 19:56:34,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2022-11-18 19:56:34,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2022-11-18 19:56:34,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2022-11-18 19:56:34,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2022-11-18 19:56:34,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2022-11-18 19:56:34,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2022-11-18 19:56:34,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2022-11-18 19:56:34,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2022-11-18 19:56:34,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2022-11-18 19:56:34,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2022-11-18 19:56:34,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2022-11-18 19:56:34,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2022-11-18 19:56:34,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2022-11-18 19:56:34,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2022-11-18 19:56:34,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2022-11-18 19:56:34,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2022-11-18 19:56:34,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2022-11-18 19:56:34,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2022-11-18 19:56:34,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2022-11-18 19:56:34,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2022-11-18 19:56:34,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2022-11-18 19:56:34,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2022-11-18 19:56:34,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2022-11-18 19:56:34,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2022-11-18 19:56:34,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2022-11-18 19:56:34,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2022-11-18 19:56:34,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2022-11-18 19:56:34,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2022-11-18 19:56:34,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2022-11-18 19:56:34,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2022-11-18 19:56:34,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2022-11-18 19:56:34,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2022-11-18 19:56:34,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2022-11-18 19:56:34,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2022-11-18 19:56:34,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2022-11-18 19:56:34,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2022-11-18 19:56:34,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2022-11-18 19:56:34,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2022-11-18 19:56:34,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2022-11-18 19:56:34,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2022-11-18 19:56:34,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2022-11-18 19:56:34,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2022-11-18 19:56:34,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2022-11-18 19:56:34,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2022-11-18 19:56:34,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2022-11-18 19:56:34,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2022-11-18 19:56:34,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2022-11-18 19:56:34,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2022-11-18 19:56:34,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2022-11-18 19:56:34,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2022-11-18 19:56:34,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2022-11-18 19:56:34,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2022-11-18 19:56:34,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2022-11-18 19:56:34,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2022-11-18 19:56:34,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2022-11-18 19:56:34,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2022-11-18 19:56:34,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2022-11-18 19:56:34,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2022-11-18 19:56:34,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2022-11-18 19:56:34,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2022-11-18 19:56:34,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2022-11-18 19:56:34,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2022-11-18 19:56:34,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2022-11-18 19:56:34,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2022-11-18 19:56:34,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2022-11-18 19:56:34,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2022-11-18 19:56:34,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2022-11-18 19:56:34,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2022-11-18 19:56:34,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2022-11-18 19:56:34,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2022-11-18 19:56:34,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2022-11-18 19:56:34,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2022-11-18 19:56:34,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2022-11-18 19:56:34,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2022-11-18 19:56:34,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2022-11-18 19:56:34,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2022-11-18 19:56:34,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2022-11-18 19:56:34,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2022-11-18 19:56:34,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2022-11-18 19:56:34,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2022-11-18 19:56:34,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2022-11-18 19:56:34,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2022-11-18 19:56:34,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2022-11-18 19:56:34,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2022-11-18 19:56:34,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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 (15)] Forceful destruction successful, exit code 0 [2022-11-18 19:56:34,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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:56:34,436 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:34,442 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 19:56:34,443 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:56:34,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:56:34 BasicIcfg [2022-11-18 19:56:34,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:56:34,580 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:56:34,580 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:56:34,581 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:56:34,581 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:36" (3/4) ... [2022-11-18 19:56:34,583 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 19:56:34,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:56:34,584 INFO L158 Benchmark]: Toolchain (without parser) took 60707.48ms. Allocated memory was 73.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 54.0MB in the beginning and 789.1MB in the end (delta: -735.2MB). Peak memory consumption was 361.5MB. Max. memory is 16.1GB. [2022-11-18 19:56:34,584 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 73.4MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:56:34,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 927.70ms. Allocated memory is still 73.4MB. Free memory was 53.8MB in the beginning and 42.4MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 19:56:34,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.73ms. Allocated memory is still 73.4MB. Free memory was 42.4MB in the beginning and 39.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:56:34,585 INFO L158 Benchmark]: Boogie Preprocessor took 48.14ms. Allocated memory is still 73.4MB. Free memory was 39.9MB in the beginning and 37.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:56:34,585 INFO L158 Benchmark]: RCFGBuilder took 1872.19ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 37.3MB in the beginning and 46.4MB in the end (delta: -9.1MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2022-11-18 19:56:34,586 INFO L158 Benchmark]: TraceAbstraction took 57738.18ms. Allocated memory was 92.3MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 45.7MB in the beginning and 789.1MB in the end (delta: -743.4MB). Peak memory consumption was 334.9MB. Max. memory is 16.1GB. [2022-11-18 19:56:34,586 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 1.2GB. Free memory is still 789.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:56:34,587 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.38ms. Allocated memory is still 73.4MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 927.70ms. Allocated memory is still 73.4MB. Free memory was 53.8MB in the beginning and 42.4MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.73ms. Allocated memory is still 73.4MB. Free memory was 42.4MB in the beginning and 39.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.14ms. Allocated memory is still 73.4MB. Free memory was 39.9MB in the beginning and 37.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1872.19ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 37.3MB in the beginning and 46.4MB in the end (delta: -9.1MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * TraceAbstraction took 57738.18ms. Allocated memory was 92.3MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 45.7MB in the beginning and 789.1MB in the end (delta: -743.4MB). Peak memory consumption was 334.9MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 1.2GB. Free memory is still 789.1MB. 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: 33.0s, 190 PlacesBefore, 85 PlacesAfterwards, 182 TransitionsBefore, 76 TransitionsAfterwards, 7128 CoEnabledTransitionPairs, 8 FixpointIterations, 68 TrivialSequentialCompositions, 96 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 169 TotalNumberOfCompositions, 29135 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12660, independent: 12172, independent conditional: 0, independent unconditional: 12172, dependent: 435, dependent conditional: 0, dependent unconditional: 435, unknown: 53, unknown conditional: 0, unknown unconditional: 53] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4807, independent: 4728, independent conditional: 0, independent unconditional: 4728, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4807, independent: 4138, independent conditional: 0, independent unconditional: 4138, dependent: 669, dependent conditional: 0, dependent unconditional: 669, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 669, independent: 590, independent conditional: 0, independent unconditional: 590, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4091, independent: 2546, independent conditional: 0, independent unconditional: 2546, dependent: 1171, dependent conditional: 0, dependent unconditional: 1171, unknown: 374, unknown conditional: 0, unknown unconditional: 374] ], Cache Queries: [ total: 12660, independent: 7444, independent conditional: 0, independent unconditional: 7444, dependent: 362, dependent conditional: 0, dependent unconditional: 362, unknown: 4854, unknown conditional: 0, unknown unconditional: 4854] , Statistics on independence cache: Total cache size (in pairs): 780, Positive cache size: 747, Positive conditional cache size: 0, Positive unconditional cache size: 747, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5 - 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: [L737] 0 _Bool x$flush_delayed; [L748] 0 int *x$read_delayed_var; [L742] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L739] 0 _Bool x$r_buff0_thd0; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L747] 0 _Bool x$read_delayed; [L710] 0 int __unbuffered_cnt = 0; [L752] 0 _Bool x$w_buff1_used; [L749] 0 int x$w_buff0; [L751] 0 int x$w_buff1; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L738] 0 int x$mem_tmp; [L712] 0 int __unbuffered_p0_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L734] 0 _Bool main$tmp_guard1; [L733] 0 _Bool main$tmp_guard0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L750] 0 _Bool x$w_buff0_used; [L736] 0 int x = 0; [L744] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd0; [L754] 0 int y = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L746] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$r_buff1_thd2; [L849] 0 pthread_t t2216; [L850] FCALL, FORK 0 pthread_create(&t2216, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2216, ((void *)0), P0, ((void *)0))=-2, t2216={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2217; [L852] FCALL, FORK 0 pthread_create(&t2217, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2217, ((void *)0), P1, ((void *)0))=-1, t2216={7:0}, t2217={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2218; [L854] FCALL, FORK 0 pthread_create(&t2218, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2218, ((void *)0), P2, ((void *)0))=0, t2216={7:0}, t2217={14:0}, t2218={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 \read(x) [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2216={7:0}, t2217={14:0}, t2218={15:0}, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L871] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=2, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - 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: -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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 854]: 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: 852]: 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 7 procedures, 240 locations, 85 error locations. Started 1 CEGAR loops. OverallTime: 57.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 35.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 369 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 369 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1309 IncrementalHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 24 mSDtfsCounter, 1309 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51276occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 656 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 2756 SizeOfPredicates, 73 NumberOfNonLiveVariables, 2148 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:34,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97079215-39f9-442a-92cb-8d9a89a08696/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