./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe027_rmo.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85e3ce8f111292d815206f012225ed7eff4e108dc07a389f6fa2d1590522afb0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:45:05,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:45:05,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:45:05,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:45:05,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:45:05,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:45:05,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:45:05,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:45:05,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:45:05,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:45:05,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:45:05,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:45:05,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:45:05,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:45:05,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:45:05,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:45:05,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:45:05,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:45:05,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:45:05,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:45:05,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:45:05,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:45:05,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:45:05,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:45:05,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:45:05,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:45:05,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:45:05,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:45:05,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:45:05,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:45:05,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:45:05,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:45:05,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:45:05,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:45:05,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:45:05,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:45:05,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:45:05,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:45:05,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:45:05,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:45:05,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:45:05,598 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 12:45:05,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:45:05,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:45:05,635 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:45:05,635 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:45:05,636 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:45:05,636 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:45:05,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:45:05,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:45:05,637 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:45:05,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:45:05,639 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:45:05,639 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:45:05,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:45:05,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:45:05,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:45:05,640 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:45:05,640 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:45:05,640 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:45:05,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:45:05,641 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:45:05,641 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:45:05,641 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:45:05,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:45:05,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:45:05,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:45:05,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:45:05,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:45:05,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:45:05,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:45:05,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:45:05,643 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_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85e3ce8f111292d815206f012225ed7eff4e108dc07a389f6fa2d1590522afb0 [2022-11-16 12:45:05,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:45:06,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:45:06,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:45:06,020 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:45:06,021 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:45:06,022 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe027_rmo.i [2022-11-16 12:45:06,096 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/data/ebc68b91c/5dbc23a1304e49d88dcf690c5b516429/FLAGb2cb4b58b [2022-11-16 12:45:06,853 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:45:06,854 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/sv-benchmarks/c/pthread-wmm/safe027_rmo.i [2022-11-16 12:45:06,877 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/data/ebc68b91c/5dbc23a1304e49d88dcf690c5b516429/FLAGb2cb4b58b [2022-11-16 12:45:07,066 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/data/ebc68b91c/5dbc23a1304e49d88dcf690c5b516429 [2022-11-16 12:45:07,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:45:07,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:45:07,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:45:07,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:45:07,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:45:07,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:45:07" (1/1) ... [2022-11-16 12:45:07,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@111bb730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:07, skipping insertion in model container [2022-11-16 12:45:07,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:45:07" (1/1) ... [2022-11-16 12:45:07,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:45:07,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:45:07,453 WARN L229 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_08b330ce-ce5c-4684-8716-33fcf9ae85ba/sv-benchmarks/c/pthread-wmm/safe027_rmo.i[988,1001] [2022-11-16 12:45:07,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:45:07,829 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:45:07,851 WARN L229 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_08b330ce-ce5c-4684-8716-33fcf9ae85ba/sv-benchmarks/c/pthread-wmm/safe027_rmo.i[988,1001] [2022-11-16 12:45:07,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:45:07,956 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:45:07,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:07 WrapperNode [2022-11-16 12:45:07,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:45:07,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:45:07,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:45:07,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:45:07,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:07" (1/1) ... [2022-11-16 12:45:08,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:07" (1/1) ... [2022-11-16 12:45:08,072 INFO L138 Inliner]: procedures = 177, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 152 [2022-11-16 12:45:08,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:45:08,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:45:08,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:45:08,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:45:08,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:07" (1/1) ... [2022-11-16 12:45:08,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:07" (1/1) ... [2022-11-16 12:45:08,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:07" (1/1) ... [2022-11-16 12:45:08,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:07" (1/1) ... [2022-11-16 12:45:08,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:07" (1/1) ... [2022-11-16 12:45:08,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:07" (1/1) ... [2022-11-16 12:45:08,149 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:07" (1/1) ... [2022-11-16 12:45:08,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:07" (1/1) ... [2022-11-16 12:45:08,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:45:08,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:45:08,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:45:08,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:45:08,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:07" (1/1) ... [2022-11-16 12:45:08,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:45:08,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:45:08,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:45:08,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:45:08,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:45:08,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:45:08,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:45:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:45:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:45:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:45:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 12:45:08,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 12:45:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 12:45:08,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 12:45:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 12:45:08,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 12:45:08,286 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 12:45:08,286 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 12:45:08,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:45:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:45:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:45:08,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:45:08,290 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:45:08,508 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:45:08,510 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:45:09,315 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:45:09,901 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:45:09,901 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:45:09,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:45:09 BoogieIcfgContainer [2022-11-16 12:45:09,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:45:09,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:45:09,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:45:09,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:45:09,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:45:07" (1/3) ... [2022-11-16 12:45:09,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e77fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:45:09, skipping insertion in model container [2022-11-16 12:45:09,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:07" (2/3) ... [2022-11-16 12:45:09,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e77fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:45:09, skipping insertion in model container [2022-11-16 12:45:09,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:45:09" (3/3) ... [2022-11-16 12:45:09,919 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_rmo.i [2022-11-16 12:45:09,942 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:45:09,943 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-11-16 12:45:09,943 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:45:10,159 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:45:10,227 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 12:45:10,248 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 198 transitions, 416 flow [2022-11-16 12:45:10,254 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 198 transitions, 416 flow [2022-11-16 12:45:10,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 198 transitions, 416 flow [2022-11-16 12:45:10,429 INFO L130 PetriNetUnfolder]: 2/194 cut-off events. [2022-11-16 12:45:10,430 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:45:10,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 194 events. 2/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 267 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2022-11-16 12:45:10,445 INFO L119 LiptonReduction]: Number of co-enabled transitions 8132 [2022-11-16 12:45:31,507 INFO L134 LiptonReduction]: Checked pairs total: 26229 [2022-11-16 12:45:31,508 INFO L136 LiptonReduction]: Total number of compositions: 189 [2022-11-16 12:45:31,517 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 80 transitions, 180 flow [2022-11-16 12:45:37,698 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 127008 states, 115970 states have (on average 4.828904026903509) internal successors, (560008), 127007 states have internal predecessors, (560008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:37,729 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:45:37,737 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;@48fdb26b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:45:37,737 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-11-16 12:45:37,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 127008 states, 115970 states have (on average 4.828904026903509) internal successors, (560008), 127007 states have internal predecessors, (560008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:37,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 12:45:37,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:37,905 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 12:45:37,906 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:37,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:37,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1044, now seen corresponding path program 1 times [2022-11-16 12:45:37,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:37,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928382579] [2022-11-16 12:45:37,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:37,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:38,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:38,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928382579] [2022-11-16 12:45:38,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928382579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:38,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:38,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 12:45:38,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162169993] [2022-11-16 12:45:38,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:38,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:45:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:38,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:45:38,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:45:38,774 INFO L87 Difference]: Start difference. First operand has 127008 states, 115970 states have (on average 4.828904026903509) internal successors, (560008), 127007 states have internal predecessors, (560008), 0 states have call successors, (0), 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-16 12:45:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:39,546 INFO L93 Difference]: Finished difference Result 14186 states and 58394 transitions. [2022-11-16 12:45:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:45:39,551 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-16 12:45:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:39,775 INFO L225 Difference]: With dead ends: 14186 [2022-11-16 12:45:39,776 INFO L226 Difference]: Without dead ends: 14186 [2022-11-16 12:45:39,783 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-16 12:45:39,789 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:39,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:45:39,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14186 states. [2022-11-16 12:45:40,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14186 to 14186. [2022-11-16 12:45:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14186 states, 13782 states have (on average 4.236975765491221) internal successors, (58394), 14185 states have internal predecessors, (58394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 58394 transitions. [2022-11-16 12:45:41,021 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 58394 transitions. Word has length 1 [2022-11-16 12:45:41,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:41,021 INFO L495 AbstractCegarLoop]: Abstraction has 14186 states and 58394 transitions. [2022-11-16 12:45:41,022 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-16 12:45:41,022 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 58394 transitions. [2022-11-16 12:45:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:45:41,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:41,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:45:41,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:45:41,025 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:41,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:41,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1028732, now seen corresponding path program 1 times [2022-11-16 12:45:41,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:41,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198431540] [2022-11-16 12:45:41,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:41,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:41,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:41,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:41,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198431540] [2022-11-16 12:45:41,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198431540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:41,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:41,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:45:41,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260584361] [2022-11-16 12:45:41,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:41,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:45:41,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:41,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:45:41,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:45:41,308 INFO L87 Difference]: Start difference. First operand 14186 states and 58394 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:41,661 INFO L93 Difference]: Finished difference Result 11330 states and 42881 transitions. [2022-11-16 12:45:41,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:45:41,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-16 12:45:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:41,742 INFO L225 Difference]: With dead ends: 11330 [2022-11-16 12:45:41,742 INFO L226 Difference]: Without dead ends: 11312 [2022-11-16 12:45:41,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:45:41,744 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:41,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:45:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11312 states. [2022-11-16 12:45:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11312 to 9788. [2022-11-16 12:45:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9788 states, 9659 states have (on average 4.052593436173517) internal successors, (39144), 9787 states have internal predecessors, (39144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9788 states to 9788 states and 39144 transitions. [2022-11-16 12:45:42,347 INFO L78 Accepts]: Start accepts. Automaton has 9788 states and 39144 transitions. Word has length 3 [2022-11-16 12:45:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:42,347 INFO L495 AbstractCegarLoop]: Abstraction has 9788 states and 39144 transitions. [2022-11-16 12:45:42,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 9788 states and 39144 transitions. [2022-11-16 12:45:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:45:42,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:42,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:45:42,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:45:42,350 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:42,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1028733, now seen corresponding path program 1 times [2022-11-16 12:45:42,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:42,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232337327] [2022-11-16 12:45:42,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:42,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:42,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:42,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232337327] [2022-11-16 12:45:42,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232337327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:42,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:42,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:45:42,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367717187] [2022-11-16 12:45:42,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:42,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:45:42,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:42,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:45:42,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:45:42,593 INFO L87 Difference]: Start difference. First operand 9788 states and 39144 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:42,965 INFO L93 Difference]: Finished difference Result 5519 states and 20718 transitions. [2022-11-16 12:45:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:45:42,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-16 12:45:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:43,008 INFO L225 Difference]: With dead ends: 5519 [2022-11-16 12:45:43,008 INFO L226 Difference]: Without dead ends: 5387 [2022-11-16 12:45:43,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:45:43,014 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:43,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:45:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2022-11-16 12:45:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 5387. [2022-11-16 12:45:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5387 states, 5353 states have (on average 3.7861012516345975) internal successors, (20267), 5386 states have internal predecessors, (20267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5387 states to 5387 states and 20267 transitions. [2022-11-16 12:45:43,330 INFO L78 Accepts]: Start accepts. Automaton has 5387 states and 20267 transitions. Word has length 3 [2022-11-16 12:45:43,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:43,331 INFO L495 AbstractCegarLoop]: Abstraction has 5387 states and 20267 transitions. [2022-11-16 12:45:43,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:43,332 INFO L276 IsEmpty]: Start isEmpty. Operand 5387 states and 20267 transitions. [2022-11-16 12:45:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:45:43,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:43,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:45:43,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:45:43,336 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:43,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1988503455, now seen corresponding path program 1 times [2022-11-16 12:45:43,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:43,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260970029] [2022-11-16 12:45:43,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:43,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:43,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:43,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260970029] [2022-11-16 12:45:43,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260970029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:43,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:43,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:45:43,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060717008] [2022-11-16 12:45:43,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:43,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:45:43,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:43,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:45:43,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:45:43,642 INFO L87 Difference]: Start difference. First operand 5387 states and 20267 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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-16 12:45:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:43,894 INFO L93 Difference]: Finished difference Result 5291 states and 19867 transitions. [2022-11-16 12:45:43,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:45:43,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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-16 12:45:43,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:43,944 INFO L225 Difference]: With dead ends: 5291 [2022-11-16 12:45:43,945 INFO L226 Difference]: Without dead ends: 5291 [2022-11-16 12:45:43,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:45:43,946 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:43,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:45:43,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2022-11-16 12:45:44,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 5291. [2022-11-16 12:45:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5291 states, 5257 states have (on average 3.7791516073806353) internal successors, (19867), 5290 states have internal predecessors, (19867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 19867 transitions. [2022-11-16 12:45:44,216 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 19867 transitions. Word has length 13 [2022-11-16 12:45:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:44,218 INFO L495 AbstractCegarLoop]: Abstraction has 5291 states and 19867 transitions. [2022-11-16 12:45:44,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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-16 12:45:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 19867 transitions. [2022-11-16 12:45:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:45:44,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:44,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:45:44,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:45:44,229 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:44,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:44,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1514071764, now seen corresponding path program 1 times [2022-11-16 12:45:44,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:44,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044887528] [2022-11-16 12:45:44,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:44,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:44,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:44,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044887528] [2022-11-16 12:45:44,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044887528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:44,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:44,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:45:44,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653236988] [2022-11-16 12:45:44,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:44,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:45:44,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:44,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:45:44,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:45:44,584 INFO L87 Difference]: Start difference. First operand 5291 states and 19867 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:44,812 INFO L93 Difference]: Finished difference Result 5243 states and 19667 transitions. [2022-11-16 12:45:44,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:45:44,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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-16 12:45:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:44,854 INFO L225 Difference]: With dead ends: 5243 [2022-11-16 12:45:44,854 INFO L226 Difference]: Without dead ends: 5243 [2022-11-16 12:45:44,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:45:44,856 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:44,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:45:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5243 states. [2022-11-16 12:45:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5243 to 5243. [2022-11-16 12:45:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5243 states, 5209 states have (on average 3.7755807256671146) internal successors, (19667), 5242 states have internal predecessors, (19667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 19667 transitions. [2022-11-16 12:45:45,214 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 19667 transitions. Word has length 14 [2022-11-16 12:45:45,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:45,215 INFO L495 AbstractCegarLoop]: Abstraction has 5243 states and 19667 transitions. [2022-11-16 12:45:45,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 19667 transitions. [2022-11-16 12:45:45,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:45:45,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:45,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:45:45,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:45:45,218 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:45,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:45,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1514062206, now seen corresponding path program 1 times [2022-11-16 12:45:45,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:45,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857314121] [2022-11-16 12:45:45,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:45,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:46,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:46,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857314121] [2022-11-16 12:45:46,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857314121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:46,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:46,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:45:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997875098] [2022-11-16 12:45:46,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:46,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:45:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:46,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:45:46,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:45:46,127 INFO L87 Difference]: Start difference. First operand 5243 states and 19667 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:46,386 INFO L93 Difference]: Finished difference Result 5099 states and 19115 transitions. [2022-11-16 12:45:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:45:46,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 12:45:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:46,419 INFO L225 Difference]: With dead ends: 5099 [2022-11-16 12:45:46,419 INFO L226 Difference]: Without dead ends: 5099 [2022-11-16 12:45:46,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:45:46,422 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:46,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:45:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5099 states. [2022-11-16 12:45:46,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5099 to 5099. [2022-11-16 12:45:46,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5099 states, 5066 states have (on average 3.773193841294907) internal successors, (19115), 5098 states have internal predecessors, (19115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 19115 transitions. [2022-11-16 12:45:46,794 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 19115 transitions. Word has length 14 [2022-11-16 12:45:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:46,795 INFO L495 AbstractCegarLoop]: Abstraction has 5099 states and 19115 transitions. [2022-11-16 12:45:46,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 19115 transitions. [2022-11-16 12:45:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:45:46,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:46,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:45:46,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:45:46,797 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:46,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:46,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1514062205, now seen corresponding path program 1 times [2022-11-16 12:45:46,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:46,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360119776] [2022-11-16 12:45:46,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:46,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:46,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:46,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360119776] [2022-11-16 12:45:46,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360119776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:46,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:46,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:45:46,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243374051] [2022-11-16 12:45:46,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:46,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:45:46,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:46,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:45:46,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:45:46,994 INFO L87 Difference]: Start difference. First operand 5099 states and 19115 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:47,215 INFO L93 Difference]: Finished difference Result 5999 states and 21800 transitions. [2022-11-16 12:45:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:45:47,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 12:45:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:47,250 INFO L225 Difference]: With dead ends: 5999 [2022-11-16 12:45:47,250 INFO L226 Difference]: Without dead ends: 5999 [2022-11-16 12:45:47,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:45:47,252 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:47,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:45:47,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2022-11-16 12:45:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 4955. [2022-11-16 12:45:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4955 states, 4923 states have (on average 3.7706682916920577) internal successors, (18563), 4954 states have internal predecessors, (18563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 18563 transitions. [2022-11-16 12:45:47,445 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 18563 transitions. Word has length 14 [2022-11-16 12:45:47,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:47,446 INFO L495 AbstractCegarLoop]: Abstraction has 4955 states and 18563 transitions. [2022-11-16 12:45:47,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 18563 transitions. [2022-11-16 12:45:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:45:47,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:47,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:45:47,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:45:47,449 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:47,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:47,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1680778800, now seen corresponding path program 1 times [2022-11-16 12:45:47,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:47,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134252175] [2022-11-16 12:45:47,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:47,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:47,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:47,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134252175] [2022-11-16 12:45:47,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134252175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:47,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:47,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:45:47,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891423218] [2022-11-16 12:45:47,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:47,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:45:47,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:47,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:45:47,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:45:47,722 INFO L87 Difference]: Start difference. First operand 4955 states and 18563 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 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-16 12:45:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:47,976 INFO L93 Difference]: Finished difference Result 7339 states and 26985 transitions. [2022-11-16 12:45:47,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:45:47,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 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-16 12:45:47,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:48,025 INFO L225 Difference]: With dead ends: 7339 [2022-11-16 12:45:48,026 INFO L226 Difference]: Without dead ends: 7339 [2022-11-16 12:45:48,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:45:48,027 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 75 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:48,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 3 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:45:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7339 states. [2022-11-16 12:45:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7339 to 5267. [2022-11-16 12:45:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5267 states, 5235 states have (on average 3.749570200573066) internal successors, (19629), 5266 states have internal predecessors, (19629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 19629 transitions. [2022-11-16 12:45:48,360 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 19629 transitions. Word has length 15 [2022-11-16 12:45:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:48,361 INFO L495 AbstractCegarLoop]: Abstraction has 5267 states and 19629 transitions. [2022-11-16 12:45:48,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 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-16 12:45:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 19629 transitions. [2022-11-16 12:45:48,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:45:48,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:48,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:45:48,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:45:48,364 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:48,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:48,365 INFO L85 PathProgramCache]: Analyzing trace with hash 731465643, now seen corresponding path program 1 times [2022-11-16 12:45:48,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:48,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879638916] [2022-11-16 12:45:48,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:48,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:48,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:48,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879638916] [2022-11-16 12:45:48,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879638916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:48,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:48,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:45:48,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278833167] [2022-11-16 12:45:48,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:48,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:45:48,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:48,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:45:48,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:45:48,883 INFO L87 Difference]: Start difference. First operand 5267 states and 19629 transitions. Second operand has 5 states, 4 states have (on average 4.0) 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-16 12:45:49,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:49,164 INFO L93 Difference]: Finished difference Result 5243 states and 19535 transitions. [2022-11-16 12:45:49,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:45:49,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) 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-16 12:45:49,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:49,193 INFO L225 Difference]: With dead ends: 5243 [2022-11-16 12:45:49,194 INFO L226 Difference]: Without dead ends: 5243 [2022-11-16 12:45:49,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:45:49,195 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 56 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:49,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 3 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:45:49,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5243 states. [2022-11-16 12:45:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5243 to 5243. [2022-11-16 12:45:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5243 states, 5211 states have (on average 3.7488006140855883) internal successors, (19535), 5242 states have internal predecessors, (19535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 19535 transitions. [2022-11-16 12:45:49,376 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 19535 transitions. Word has length 16 [2022-11-16 12:45:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:49,377 INFO L495 AbstractCegarLoop]: Abstraction has 5243 states and 19535 transitions. [2022-11-16 12:45:49,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) 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-16 12:45:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 19535 transitions. [2022-11-16 12:45:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:45:49,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:49,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:45:49,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:45:49,380 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:49,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash 970952818, now seen corresponding path program 1 times [2022-11-16 12:45:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:49,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742350087] [2022-11-16 12:45:49,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:49,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:49,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:49,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742350087] [2022-11-16 12:45:49,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742350087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:49,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:49,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:45:49,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595683074] [2022-11-16 12:45:49,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:49,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:45:49,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:49,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:45:49,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:45:49,620 INFO L87 Difference]: Start difference. First operand 5243 states and 19535 transitions. Second operand has 5 states, 4 states have (on average 4.0) 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-16 12:45:49,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:49,888 INFO L93 Difference]: Finished difference Result 5426 states and 19282 transitions. [2022-11-16 12:45:49,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:45:49,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) 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-16 12:45:49,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:49,925 INFO L225 Difference]: With dead ends: 5426 [2022-11-16 12:45:49,926 INFO L226 Difference]: Without dead ends: 5426 [2022-11-16 12:45:49,926 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-16 12:45:49,927 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 64 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:49,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 3 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:45:49,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5426 states. [2022-11-16 12:45:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5426 to 4628. [2022-11-16 12:45:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4628 states, 4596 states have (on average 3.7173629242819843) internal successors, (17085), 4627 states have internal predecessors, (17085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4628 states to 4628 states and 17085 transitions. [2022-11-16 12:45:50,166 INFO L78 Accepts]: Start accepts. Automaton has 4628 states and 17085 transitions. Word has length 16 [2022-11-16 12:45:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:50,166 INFO L495 AbstractCegarLoop]: Abstraction has 4628 states and 17085 transitions. [2022-11-16 12:45:50,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) 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-16 12:45:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 4628 states and 17085 transitions. [2022-11-16 12:45:50,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:45:50,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:50,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:45:50,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:45:50,171 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:50,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1200596858, now seen corresponding path program 1 times [2022-11-16 12:45:50,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:50,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113158264] [2022-11-16 12:45:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:50,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:52,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:52,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113158264] [2022-11-16 12:45:52,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113158264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:52,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:52,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:45:52,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633156111] [2022-11-16 12:45:52,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:52,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:45:52,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:52,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:45:52,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:45:52,623 INFO L87 Difference]: Start difference. First operand 4628 states and 17085 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-16 12:45:53,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:53,503 INFO L93 Difference]: Finished difference Result 5054 states and 18710 transitions. [2022-11-16 12:45:53,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:45:53,504 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-16 12:45:53,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:53,531 INFO L225 Difference]: With dead ends: 5054 [2022-11-16 12:45:53,531 INFO L226 Difference]: Without dead ends: 5054 [2022-11-16 12:45:53,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:45:53,533 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 127 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:53,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 16 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:45:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5054 states. [2022-11-16 12:45:53,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5054 to 4688. [2022-11-16 12:45:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4688 states, 4656 states have (on average 3.7212199312714778) internal successors, (17326), 4687 states have internal predecessors, (17326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4688 states to 4688 states and 17326 transitions. [2022-11-16 12:45:53,701 INFO L78 Accepts]: Start accepts. Automaton has 4688 states and 17326 transitions. Word has length 17 [2022-11-16 12:45:53,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:53,701 INFO L495 AbstractCegarLoop]: Abstraction has 4688 states and 17326 transitions. [2022-11-16 12:45:53,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-16 12:45:53,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4688 states and 17326 transitions. [2022-11-16 12:45:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:45:53,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:53,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:45:53,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:45:53,706 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:53,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:53,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2144274998, now seen corresponding path program 2 times [2022-11-16 12:45:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:53,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995627858] [2022-11-16 12:45:53,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:53,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:55,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:55,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995627858] [2022-11-16 12:45:55,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995627858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:55,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:55,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:45:55,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482006917] [2022-11-16 12:45:55,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:55,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:45:55,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:55,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:45:55,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:45:55,531 INFO L87 Difference]: Start difference. First operand 4688 states and 17326 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 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-16 12:45:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:56,584 INFO L93 Difference]: Finished difference Result 4724 states and 17347 transitions. [2022-11-16 12:45:56,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:45:56,585 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 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-16 12:45:56,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:56,607 INFO L225 Difference]: With dead ends: 4724 [2022-11-16 12:45:56,608 INFO L226 Difference]: Without dead ends: 4724 [2022-11-16 12:45:56,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:45:56,609 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 82 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:56,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 19 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:45:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4724 states. [2022-11-16 12:45:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4724 to 4610. [2022-11-16 12:45:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4578 states have (on average 3.7169069462647446) internal successors, (17016), 4609 states have internal predecessors, (17016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 17016 transitions. [2022-11-16 12:45:56,783 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 17016 transitions. Word has length 17 [2022-11-16 12:45:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:56,784 INFO L495 AbstractCegarLoop]: Abstraction has 4610 states and 17016 transitions. [2022-11-16 12:45:56,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 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-16 12:45:56,785 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 17016 transitions. [2022-11-16 12:45:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:45:56,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:56,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:45:56,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:45:56,789 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:56,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:56,790 INFO L85 PathProgramCache]: Analyzing trace with hash 34765539, now seen corresponding path program 1 times [2022-11-16 12:45:56,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:56,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727440317] [2022-11-16 12:45:56,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:56,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:57,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:57,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727440317] [2022-11-16 12:45:57,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727440317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:57,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:57,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:45:57,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159929567] [2022-11-16 12:45:57,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:57,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:45:57,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:57,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:45:57,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:45:57,160 INFO L87 Difference]: Start difference. First operand 4610 states and 17016 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-16 12:45:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:57,528 INFO L93 Difference]: Finished difference Result 4622 states and 16292 transitions. [2022-11-16 12:45:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:45:57,528 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-16 12:45:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:57,551 INFO L225 Difference]: With dead ends: 4622 [2022-11-16 12:45:57,552 INFO L226 Difference]: Without dead ends: 4622 [2022-11-16 12:45:57,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:45:57,553 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 144 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:57,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 8 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:45:57,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2022-11-16 12:45:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 3995. [2022-11-16 12:45:57,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3995 states, 3963 states have (on average 3.675498359828413) internal successors, (14566), 3994 states have internal predecessors, (14566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3995 states to 3995 states and 14566 transitions. [2022-11-16 12:45:57,740 INFO L78 Accepts]: Start accepts. Automaton has 3995 states and 14566 transitions. Word has length 17 [2022-11-16 12:45:57,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:57,741 INFO L495 AbstractCegarLoop]: Abstraction has 3995 states and 14566 transitions. [2022-11-16 12:45:57,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-16 12:45:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3995 states and 14566 transitions. [2022-11-16 12:45:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:45:57,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:57,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:45:57,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:45:57,746 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:57,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1500824223, now seen corresponding path program 1 times [2022-11-16 12:45:57,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:57,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126035886] [2022-11-16 12:45:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:57,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:58,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:58,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126035886] [2022-11-16 12:45:58,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126035886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:58,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:58,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:45:58,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876516059] [2022-11-16 12:45:58,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:58,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:45:58,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:58,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:45:58,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:45:58,057 INFO L87 Difference]: Start difference. First operand 3995 states and 14566 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:58,179 INFO L93 Difference]: Finished difference Result 2745 states and 8954 transitions. [2022-11-16 12:45:58,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:45:58,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 12:45:58,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:58,188 INFO L225 Difference]: With dead ends: 2745 [2022-11-16 12:45:58,188 INFO L226 Difference]: Without dead ends: 2745 [2022-11-16 12:45:58,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:45:58,189 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:58,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:45:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2022-11-16 12:45:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 2745. [2022-11-16 12:45:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2745 states, 2713 states have (on average 3.3004054552156283) internal successors, (8954), 2744 states have internal predecessors, (8954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 8954 transitions. [2022-11-16 12:45:58,298 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 8954 transitions. Word has length 18 [2022-11-16 12:45:58,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:58,299 INFO L495 AbstractCegarLoop]: Abstraction has 2745 states and 8954 transitions. [2022-11-16 12:45:58,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 8954 transitions. [2022-11-16 12:45:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 12:45:58,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:58,303 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-16 12:45:58,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:45:58,304 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:58,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:58,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1551416770, now seen corresponding path program 1 times [2022-11-16 12:45:58,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:58,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58600762] [2022-11-16 12:45:58,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:58,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:58,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:58,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58600762] [2022-11-16 12:45:58,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58600762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:58,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:58,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:45:58,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645765955] [2022-11-16 12:45:58,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:58,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:45:58,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:58,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:45:58,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:45:58,645 INFO L87 Difference]: Start difference. First operand 2745 states and 8954 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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-16 12:45:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:58,815 INFO L93 Difference]: Finished difference Result 1304 states and 3633 transitions. [2022-11-16 12:45:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:45:58,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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-16 12:45:58,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:58,819 INFO L225 Difference]: With dead ends: 1304 [2022-11-16 12:45:58,819 INFO L226 Difference]: Without dead ends: 1304 [2022-11-16 12:45:58,821 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-16 12:45:58,822 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:58,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:45:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-11-16 12:45:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2022-11-16 12:45:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1278 states have (on average 2.8427230046948355) internal successors, (3633), 1303 states have internal predecessors, (3633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 3633 transitions. [2022-11-16 12:45:58,867 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 3633 transitions. Word has length 19 [2022-11-16 12:45:58,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:58,868 INFO L495 AbstractCegarLoop]: Abstraction has 1304 states and 3633 transitions. [2022-11-16 12:45:58,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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-16 12:45:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 3633 transitions. [2022-11-16 12:45:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 12:45:58,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:58,871 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-16 12:45:58,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:45:58,871 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:58,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:58,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1507483553, now seen corresponding path program 1 times [2022-11-16 12:45:58,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:58,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2667086] [2022-11-16 12:45:58,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:58,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:45:59,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:59,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2667086] [2022-11-16 12:45:59,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2667086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:45:59,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:45:59,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:45:59,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167896751] [2022-11-16 12:45:59,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:45:59,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:45:59,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:59,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:45:59,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:45:59,322 INFO L87 Difference]: Start difference. First operand 1304 states and 3633 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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-16 12:45:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:59,512 INFO L93 Difference]: Finished difference Result 688 states and 1851 transitions. [2022-11-16 12:45:59,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:45:59,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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-16 12:45:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:59,515 INFO L225 Difference]: With dead ends: 688 [2022-11-16 12:45:59,515 INFO L226 Difference]: Without dead ends: 688 [2022-11-16 12:45:59,515 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-16 12:45:59,516 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 49 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:59,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 7 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:45:59,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-11-16 12:45:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2022-11-16 12:45:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 676 states have (on average 2.7381656804733727) internal successors, (1851), 687 states have internal predecessors, (1851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1851 transitions. [2022-11-16 12:45:59,541 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1851 transitions. Word has length 21 [2022-11-16 12:45:59,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:59,542 INFO L495 AbstractCegarLoop]: Abstraction has 688 states and 1851 transitions. [2022-11-16 12:45:59,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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-16 12:45:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1851 transitions. [2022-11-16 12:45:59,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 12:45:59,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:59,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:45:59,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:45:59,549 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:45:59,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:59,551 INFO L85 PathProgramCache]: Analyzing trace with hash 698990424, now seen corresponding path program 1 times [2022-11-16 12:45:59,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:59,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749160001] [2022-11-16 12:45:59,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:59,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:00,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:00,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749160001] [2022-11-16 12:46:00,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749160001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:00,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:00,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:46:00,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141507559] [2022-11-16 12:46:00,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:00,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:46:00,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:00,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:46:00,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:46:00,074 INFO L87 Difference]: Start difference. First operand 688 states and 1851 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:00,264 INFO L93 Difference]: Finished difference Result 564 states and 1603 transitions. [2022-11-16 12:46:00,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:46:00,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-16 12:46:00,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:00,267 INFO L225 Difference]: With dead ends: 564 [2022-11-16 12:46:00,267 INFO L226 Difference]: Without dead ends: 564 [2022-11-16 12:46:00,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:46:00,268 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 105 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:00,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 7 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:46:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-11-16 12:46:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2022-11-16 12:46:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 562 states have (on average 2.8523131672597866) internal successors, (1603), 563 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1603 transitions. [2022-11-16 12:46:00,289 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1603 transitions. Word has length 23 [2022-11-16 12:46:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:00,290 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 1603 transitions. [2022-11-16 12:46:00,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:00,290 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1603 transitions. [2022-11-16 12:46:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:46:00,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:00,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:00,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:46:00,296 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:46:00,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:00,297 INFO L85 PathProgramCache]: Analyzing trace with hash -994347307, now seen corresponding path program 1 times [2022-11-16 12:46:00,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:00,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514540069] [2022-11-16 12:46:00,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:00,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:00,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:00,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514540069] [2022-11-16 12:46:00,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514540069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:00,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:00,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:46:00,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519695362] [2022-11-16 12:46:00,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:00,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:46:00,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:00,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:46:00,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:46:00,689 INFO L87 Difference]: Start difference. First operand 564 states and 1603 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:00,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:00,863 INFO L93 Difference]: Finished difference Result 781 states and 2141 transitions. [2022-11-16 12:46:00,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:46:00,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-16 12:46:00,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:00,866 INFO L225 Difference]: With dead ends: 781 [2022-11-16 12:46:00,866 INFO L226 Difference]: Without dead ends: 781 [2022-11-16 12:46:00,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:46:00,867 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:00,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 7 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:46:00,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-11-16 12:46:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 520. [2022-11-16 12:46:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 518 states have (on average 2.805019305019305) internal successors, (1453), 519 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:00,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1453 transitions. [2022-11-16 12:46:00,889 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1453 transitions. Word has length 25 [2022-11-16 12:46:00,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:00,889 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 1453 transitions. [2022-11-16 12:46:00,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1453 transitions. [2022-11-16 12:46:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:46:00,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:00,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:00,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 12:46:00,893 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:46:00,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:00,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1545064561, now seen corresponding path program 2 times [2022-11-16 12:46:00,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:00,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705037661] [2022-11-16 12:46:00,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:00,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:03,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:03,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705037661] [2022-11-16 12:46:03,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705037661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:03,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:03,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:46:03,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748754124] [2022-11-16 12:46:03,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:03,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:46:03,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:03,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:46:03,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:46:03,766 INFO L87 Difference]: Start difference. First operand 520 states and 1453 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:04,443 INFO L93 Difference]: Finished difference Result 1173 states and 3182 transitions. [2022-11-16 12:46:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:46:04,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-16 12:46:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:04,447 INFO L225 Difference]: With dead ends: 1173 [2022-11-16 12:46:04,447 INFO L226 Difference]: Without dead ends: 1173 [2022-11-16 12:46:04,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:46:04,448 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 59 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:04,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 14 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:46:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-11-16 12:46:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 496. [2022-11-16 12:46:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 494 states have (on average 2.811740890688259) internal successors, (1389), 495 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1389 transitions. [2022-11-16 12:46:04,470 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 1389 transitions. Word has length 25 [2022-11-16 12:46:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:04,472 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 1389 transitions. [2022-11-16 12:46:04,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 1389 transitions. [2022-11-16 12:46:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:46:04,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:04,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:04,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 12:46:04,475 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:46:04,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:04,475 INFO L85 PathProgramCache]: Analyzing trace with hash -697064193, now seen corresponding path program 3 times [2022-11-16 12:46:04,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:04,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741358643] [2022-11-16 12:46:04,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:04,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:46:04,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:46:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:46:04,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:46:04,798 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:46:04,799 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (79 of 80 remaining) [2022-11-16 12:46:04,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2022-11-16 12:46:04,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 80 remaining) [2022-11-16 12:46:04,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 80 remaining) [2022-11-16 12:46:04,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 80 remaining) [2022-11-16 12:46:04,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 80 remaining) [2022-11-16 12:46:04,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2022-11-16 12:46:04,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2022-11-16 12:46:04,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2022-11-16 12:46:04,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 80 remaining) [2022-11-16 12:46:04,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2022-11-16 12:46:04,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2022-11-16 12:46:04,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2022-11-16 12:46:04,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2022-11-16 12:46:04,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 80 remaining) [2022-11-16 12:46:04,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2022-11-16 12:46:04,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2022-11-16 12:46:04,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2022-11-16 12:46:04,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 80 remaining) [2022-11-16 12:46:04,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2022-11-16 12:46:04,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 80 remaining) [2022-11-16 12:46:04,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 80 remaining) [2022-11-16 12:46:04,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2022-11-16 12:46:04,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2022-11-16 12:46:04,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2022-11-16 12:46:04,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2022-11-16 12:46:04,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2022-11-16 12:46:04,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 80 remaining) [2022-11-16 12:46:04,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 80 remaining) [2022-11-16 12:46:04,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 80 remaining) [2022-11-16 12:46:04,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 80 remaining) [2022-11-16 12:46:04,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 80 remaining) [2022-11-16 12:46:04,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 80 remaining) [2022-11-16 12:46:04,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2022-11-16 12:46:04,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2022-11-16 12:46:04,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2022-11-16 12:46:04,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2022-11-16 12:46:04,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 80 remaining) [2022-11-16 12:46:04,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 80 remaining) [2022-11-16 12:46:04,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 80 remaining) [2022-11-16 12:46:04,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 80 remaining) [2022-11-16 12:46:04,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 80 remaining) [2022-11-16 12:46:04,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 80 remaining) [2022-11-16 12:46:04,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 80 remaining) [2022-11-16 12:46:04,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 80 remaining) [2022-11-16 12:46:04,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (34 of 80 remaining) [2022-11-16 12:46:04,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 80 remaining) [2022-11-16 12:46:04,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 80 remaining) [2022-11-16 12:46:04,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 80 remaining) [2022-11-16 12:46:04,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 80 remaining) [2022-11-16 12:46:04,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 80 remaining) [2022-11-16 12:46:04,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 80 remaining) [2022-11-16 12:46:04,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 80 remaining) [2022-11-16 12:46:04,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2022-11-16 12:46:04,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2022-11-16 12:46:04,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 80 remaining) [2022-11-16 12:46:04,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2022-11-16 12:46:04,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2022-11-16 12:46:04,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2022-11-16 12:46:04,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 80 remaining) [2022-11-16 12:46:04,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2022-11-16 12:46:04,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2022-11-16 12:46:04,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 80 remaining) [2022-11-16 12:46:04,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 80 remaining) [2022-11-16 12:46:04,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 80 remaining) [2022-11-16 12:46:04,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2022-11-16 12:46:04,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2022-11-16 12:46:04,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 80 remaining) [2022-11-16 12:46:04,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2022-11-16 12:46:04,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2022-11-16 12:46:04,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 80 remaining) [2022-11-16 12:46:04,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 80 remaining) [2022-11-16 12:46:04,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 80 remaining) [2022-11-16 12:46:04,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 80 remaining) [2022-11-16 12:46:04,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2022-11-16 12:46:04,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2022-11-16 12:46:04,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 80 remaining) [2022-11-16 12:46:04,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 80 remaining) [2022-11-16 12:46:04,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 80 remaining) [2022-11-16 12:46:04,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 80 remaining) [2022-11-16 12:46:04,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 12:46:04,829 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:04,838 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:46:04,838 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:46:05,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:46:05 BasicIcfg [2022-11-16 12:46:05,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:46:05,005 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:46:05,005 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:46:05,006 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:46:05,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:45:09" (3/4) ... [2022-11-16 12:46:05,009 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 12:46:05,010 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:46:05,011 INFO L158 Benchmark]: Toolchain (without parser) took 57938.81ms. Allocated memory was 151.0MB in the beginning and 8.9GB in the end (delta: 8.7GB). Free memory was 114.6MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2022-11-16 12:46:05,011 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 151.0MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:46:05,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 879.82ms. Allocated memory is still 151.0MB. Free memory was 114.5MB in the beginning and 113.5MB in the end (delta: 944.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 12:46:05,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.66ms. Allocated memory is still 151.0MB. Free memory was 113.5MB in the beginning and 110.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:46:05,013 INFO L158 Benchmark]: Boogie Preprocessor took 79.35ms. Allocated memory is still 151.0MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:46:05,013 INFO L158 Benchmark]: RCFGBuilder took 1748.81ms. Allocated memory is still 151.0MB. Free memory was 108.8MB in the beginning and 69.2MB in the end (delta: 39.6MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2022-11-16 12:46:05,014 INFO L158 Benchmark]: TraceAbstraction took 55093.85ms. Allocated memory was 151.0MB in the beginning and 8.9GB in the end (delta: 8.7GB). Free memory was 68.4MB in the beginning and 6.1GB in the end (delta: -6.1GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2022-11-16 12:46:05,015 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 8.9GB. Free memory is still 6.1GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:46:05,019 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.39ms. Allocated memory is still 151.0MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 879.82ms. Allocated memory is still 151.0MB. Free memory was 114.5MB in the beginning and 113.5MB in the end (delta: 944.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.66ms. Allocated memory is still 151.0MB. Free memory was 113.5MB in the beginning and 110.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.35ms. Allocated memory is still 151.0MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1748.81ms. Allocated memory is still 151.0MB. Free memory was 108.8MB in the beginning and 69.2MB in the end (delta: 39.6MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. * TraceAbstraction took 55093.85ms. Allocated memory was 151.0MB in the beginning and 8.9GB in the end (delta: 8.7GB). Free memory was 68.4MB in the beginning and 6.1GB in the end (delta: -6.1GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 8.9GB. Free memory is still 6.1GB. 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: 21.3s, 209 PlacesBefore, 92 PlacesAfterwards, 198 TransitionsBefore, 80 TransitionsAfterwards, 8132 CoEnabledTransitionPairs, 8 FixpointIterations, 76 TrivialSequentialCompositions, 105 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 189 TotalNumberOfCompositions, 26229 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13696, independent: 13265, independent conditional: 0, independent unconditional: 13265, dependent: 346, dependent conditional: 0, dependent unconditional: 346, unknown: 85, unknown conditional: 0, unknown unconditional: 85] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5491, independent: 5399, independent conditional: 0, independent unconditional: 5399, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5491, independent: 4815, independent conditional: 0, independent unconditional: 4815, dependent: 676, dependent conditional: 0, dependent unconditional: 676, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 676, independent: 584, independent conditional: 0, independent unconditional: 584, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3494, independent: 2657, independent conditional: 0, independent unconditional: 2657, dependent: 518, dependent conditional: 0, dependent unconditional: 518, unknown: 320, unknown conditional: 0, unknown unconditional: 320] ], Cache Queries: [ total: 13696, independent: 7866, independent conditional: 0, independent unconditional: 7866, dependent: 267, dependent conditional: 0, dependent unconditional: 267, unknown: 5563, unknown conditional: 0, unknown unconditional: 5563] , Statistics on independence cache: Total cache size (in pairs): 765, Positive cache size: 731, Positive conditional cache size: 0, Positive unconditional cache size: 731, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7 - 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: [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L758] 0 int y$w_buff0; [L760] 0 int y$w_buff1; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L745] 0 int y$mem_tmp; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L756] 0 _Bool y$read_delayed; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L711] 0 int __unbuffered_cnt = 0; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L761] 0 _Bool y$w_buff1_used; [L757] 0 int *y$read_delayed_var; [L737] 0 int __unbuffered_p2_EBX = 0; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L713] 0 int __unbuffered_p0_EAX = 0; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L735] 0 int __unbuffered_p2_EAX = 0; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L744] 0 _Bool y$flush_delayed; [L733] 0 int __unbuffered_p0_EBX = 0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L739] 0 _Bool main$tmp_guard1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L738] 0 _Bool main$tmp_guard0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L759] 0 _Bool y$w_buff0_used; [L741] 0 int x = 0; [L751] 0 _Bool y$r_buff1_thd0; [L743] 0 int y = 0; [L753] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd1; [L755] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$r_buff1_thd3; [L863] 0 pthread_t t2433; [L864] FCALL, FORK 0 pthread_create(&t2433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2433, ((void *)0), P0, ((void *)0))=-3, t2433={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L865] 0 pthread_t t2434; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2433={7:0}, t2434={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L866] FCALL, FORK 0 pthread_create(&t2434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2434, ((void *)0), P1, ((void *)0))=-2, t2433={7:0}, t2434={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L867] 0 pthread_t t2435; [L868] FCALL, FORK 0 pthread_create(&t2435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2435, ((void *)0), P2, ((void *)0))=-1, t2433={7:0}, t2434={8:0}, t2435={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L869] 0 pthread_t t2436; [L870] FCALL, FORK 0 pthread_create(&t2436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2436, ((void *)0), P3, ((void *)0))=0, t2433={7:0}, t2434={8:0}, t2435={9:0}, t2436={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L772] EXPR 1 \read(y) [L772] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L772] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L773] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L774] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L775] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L776] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L778] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L779] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L780] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L781] EXPR 1 \read(y) [L781] 1 __unbuffered_p0_EAX = y [L782] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L782] 1 y = y$flush_delayed ? y$mem_tmp : y [L783] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, weak$$choice1=0, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L814] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L815] 3 y$flush_delayed = weak$$choice2 [L816] EXPR 3 \read(y) [L816] 3 y$mem_tmp = y [L817] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] EXPR 3 \read(y) [L817] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L819] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L820] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L821] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L823] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 \read(y) [L824] 3 __unbuffered_p2_EBX = y [L825] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L825] EXPR 3 \read(y) [L825] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L825] 3 y = y$flush_delayed ? y$mem_tmp : y [L826] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 4 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L791] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 1 return 0; [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L841] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L841] EXPR 4 \read(y) [L841] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L841] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L850] 4 return 0; [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L876] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L876] EXPR 0 \read(y) [L876] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L876] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L876] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2433={7:0}, t2434={8:0}, t2435={9:0}, t2436={5:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L887] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 861]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 868]: 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: 870]: 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: 866]: 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: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 258 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 54.6s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 27.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1017 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1017 mSDsluCounter, 113 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2436 IncrementalHoareTripleChecker+Invalid, 2646 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 41 mSDtfsCounter, 2436 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127008occurred in iteration=0, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 7483 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 2489 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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-16 12:46:05,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85e3ce8f111292d815206f012225ed7eff4e108dc07a389f6fa2d1590522afb0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:46:07,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:46:07,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:46:07,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:46:07,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:46:07,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:46:07,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:46:07,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:46:07,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:46:07,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:46:07,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:46:07,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:46:07,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:46:07,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:46:07,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:46:07,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:46:07,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:46:07,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:46:07,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:46:07,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:46:07,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:46:07,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:46:07,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:46:07,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:46:07,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:46:07,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:46:07,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:46:07,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:46:07,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:46:07,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:46:07,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:46:07,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:46:07,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:46:07,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:46:07,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:46:07,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:46:07,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:46:07,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:46:07,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:46:07,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:46:07,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:46:07,897 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 12:46:07,925 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:46:07,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:46:07,926 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:46:07,926 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:46:07,927 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:46:07,928 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:46:07,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:46:07,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:46:07,930 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:46:07,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:46:07,930 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:46:07,931 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:46:07,931 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:46:07,931 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:46:07,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:46:07,932 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:46:07,932 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:46:07,933 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:46:07,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:46:07,933 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:46:07,934 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:46:07,934 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:46:07,934 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:46:07,935 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:46:07,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:46:07,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:46:07,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:46:07,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:46:07,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:46:07,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:46:07,937 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:46:07,937 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:46:07,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:46:07,937 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_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85e3ce8f111292d815206f012225ed7eff4e108dc07a389f6fa2d1590522afb0 [2022-11-16 12:46:08,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:46:08,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:46:08,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:46:08,405 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:46:08,411 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:46:08,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe027_rmo.i [2022-11-16 12:46:08,499 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/data/09fb2f921/3a2bcc60559b499cb9432187b5ba1d79/FLAGdf9296ee1 [2022-11-16 12:46:09,176 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:46:09,177 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/sv-benchmarks/c/pthread-wmm/safe027_rmo.i [2022-11-16 12:46:09,192 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/data/09fb2f921/3a2bcc60559b499cb9432187b5ba1d79/FLAGdf9296ee1 [2022-11-16 12:46:09,376 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/data/09fb2f921/3a2bcc60559b499cb9432187b5ba1d79 [2022-11-16 12:46:09,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:46:09,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:46:09,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:46:09,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:46:09,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:46:09,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:46:09" (1/1) ... [2022-11-16 12:46:09,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77615634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:09, skipping insertion in model container [2022-11-16 12:46:09,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:46:09" (1/1) ... [2022-11-16 12:46:09,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:46:09,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:46:09,653 WARN L229 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_08b330ce-ce5c-4684-8716-33fcf9ae85ba/sv-benchmarks/c/pthread-wmm/safe027_rmo.i[988,1001] [2022-11-16 12:46:10,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:46:10,094 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:46:10,112 WARN L229 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_08b330ce-ce5c-4684-8716-33fcf9ae85ba/sv-benchmarks/c/pthread-wmm/safe027_rmo.i[988,1001] [2022-11-16 12:46:10,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:46:10,274 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:46:10,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:10 WrapperNode [2022-11-16 12:46:10,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:46:10,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:46:10,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:46:10,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:46:10,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:10" (1/1) ... [2022-11-16 12:46:10,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:10" (1/1) ... [2022-11-16 12:46:10,403 INFO L138 Inliner]: procedures = 181, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 153 [2022-11-16 12:46:10,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:46:10,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:46:10,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:46:10,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:46:10,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:10" (1/1) ... [2022-11-16 12:46:10,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:10" (1/1) ... [2022-11-16 12:46:10,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:10" (1/1) ... [2022-11-16 12:46:10,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:10" (1/1) ... [2022-11-16 12:46:10,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:10" (1/1) ... [2022-11-16 12:46:10,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:10" (1/1) ... [2022-11-16 12:46:10,477 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:10" (1/1) ... [2022-11-16 12:46:10,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:10" (1/1) ... [2022-11-16 12:46:10,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:46:10,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:46:10,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:46:10,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:46:10,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:10" (1/1) ... [2022-11-16 12:46:10,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:46:10,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:10,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:46:10,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:46:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 12:46:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:46:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:46:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:46:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:46:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 12:46:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 12:46:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-16 12:46:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 12:46:10,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 12:46:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 12:46:10,605 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 12:46:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 12:46:10,605 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 12:46:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 12:46:10,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 12:46:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:46:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:46:10,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:46:10,609 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:46:10,905 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:46:10,908 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:46:12,011 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:46:12,604 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:46:12,604 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:46:12,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:12 BoogieIcfgContainer [2022-11-16 12:46:12,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:46:12,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:46:12,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:46:12,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:46:12,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:46:09" (1/3) ... [2022-11-16 12:46:12,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e4f94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:46:12, skipping insertion in model container [2022-11-16 12:46:12,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:10" (2/3) ... [2022-11-16 12:46:12,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e4f94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:46:12, skipping insertion in model container [2022-11-16 12:46:12,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:12" (3/3) ... [2022-11-16 12:46:12,623 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_rmo.i [2022-11-16 12:46:12,645 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:46:12,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-11-16 12:46:12,646 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:46:12,891 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:46:12,948 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 12:46:12,969 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 199 transitions, 418 flow [2022-11-16 12:46:12,975 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 199 transitions, 418 flow [2022-11-16 12:46:12,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 199 transitions, 418 flow [2022-11-16 12:46:13,126 INFO L130 PetriNetUnfolder]: 2/195 cut-off events. [2022-11-16 12:46:13,127 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:46:13,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 195 events. 2/195 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 265 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2022-11-16 12:46:13,146 INFO L119 LiptonReduction]: Number of co-enabled transitions 8132 [2022-11-16 12:46:58,926 INFO L134 LiptonReduction]: Checked pairs total: 25942 [2022-11-16 12:46:58,927 INFO L136 LiptonReduction]: Total number of compositions: 186 [2022-11-16 12:46:58,935 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 80 transitions, 180 flow [2022-11-16 12:47:05,340 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 127008 states, 115970 states have (on average 4.828904026903509) internal successors, (560008), 127007 states have internal predecessors, (560008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:05,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:47:05,384 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;@727eb2c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:47:05,385 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-11-16 12:47:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 127008 states, 115970 states have (on average 4.828904026903509) internal successors, (560008), 127007 states have internal predecessors, (560008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:05,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 12:47:05,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:05,582 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 12:47:05,583 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:47:05,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:05,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1042, now seen corresponding path program 1 times [2022-11-16 12:47:05,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:05,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133883366] [2022-11-16 12:47:05,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:05,612 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-16 12:47:05,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:05,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:05,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:05,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 12:47:05,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:05,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:05,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:05,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133883366] [2022-11-16 12:47:05,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133883366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:05,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:05,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 12:47:05,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198284719] [2022-11-16 12:47:05,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:05,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:47:05,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:05,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:47:05,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:47:06,217 INFO L87 Difference]: Start difference. First operand has 127008 states, 115970 states have (on average 4.828904026903509) internal successors, (560008), 127007 states have internal predecessors, (560008), 0 states have call successors, (0), 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-16 12:47:07,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:07,585 INFO L93 Difference]: Finished difference Result 14186 states and 58394 transitions. [2022-11-16 12:47:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:47:07,588 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-16 12:47:07,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:07,848 INFO L225 Difference]: With dead ends: 14186 [2022-11-16 12:47:07,848 INFO L226 Difference]: Without dead ends: 14186 [2022-11-16 12:47:07,851 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-16 12:47:07,857 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:07,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:47:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14186 states. [2022-11-16 12:47:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14186 to 14186. [2022-11-16 12:47:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14186 states, 13782 states have (on average 4.236975765491221) internal successors, (58394), 14185 states have internal predecessors, (58394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:09,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 58394 transitions. [2022-11-16 12:47:09,205 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 58394 transitions. Word has length 1 [2022-11-16 12:47:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:09,206 INFO L495 AbstractCegarLoop]: Abstraction has 14186 states and 58394 transitions. [2022-11-16 12:47:09,206 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-16 12:47:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 58394 transitions. [2022-11-16 12:47:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:47:09,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:09,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:47:09,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:09,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:09,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:47:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:09,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1026875, now seen corresponding path program 1 times [2022-11-16 12:47:09,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:09,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436984556] [2022-11-16 12:47:09,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:09,423 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-16 12:47:09,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:09,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:09,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:09,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:47:09,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:09,848 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:47:09,849 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-16 12:47:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:09,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:09,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:09,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436984556] [2022-11-16 12:47:09,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436984556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:09,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:09,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:47:09,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754555177] [2022-11-16 12:47:09,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:09,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:47:09,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:09,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:47:09,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:47:09,896 INFO L87 Difference]: Start difference. First operand 14186 states and 58394 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:10,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:10,370 INFO L93 Difference]: Finished difference Result 7946 states and 31748 transitions. [2022-11-16 12:47:10,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:47:10,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-16 12:47:10,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:10,435 INFO L225 Difference]: With dead ends: 7946 [2022-11-16 12:47:10,435 INFO L226 Difference]: Without dead ends: 7946 [2022-11-16 12:47:10,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:47:10,437 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:10,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:47:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7946 states. [2022-11-16 12:47:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7946 to 7946. [2022-11-16 12:47:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7946 states, 7817 states have (on average 4.061404630932583) internal successors, (31748), 7945 states have internal predecessors, (31748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:10,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7946 states to 7946 states and 31748 transitions. [2022-11-16 12:47:10,835 INFO L78 Accepts]: Start accepts. Automaton has 7946 states and 31748 transitions. Word has length 3 [2022-11-16 12:47:10,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:10,839 INFO L495 AbstractCegarLoop]: Abstraction has 7946 states and 31748 transitions. [2022-11-16 12:47:10,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 7946 states and 31748 transitions. [2022-11-16 12:47:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:47:10,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:10,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:47:10,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:11,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:11,055 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:47:11,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:11,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1026876, now seen corresponding path program 1 times [2022-11-16 12:47:11,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:11,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632467834] [2022-11-16 12:47:11,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:11,056 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-16 12:47:11,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:11,059 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:11,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:11,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:47:11,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:11,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:11,553 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-16 12:47:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:11,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:11,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:11,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632467834] [2022-11-16 12:47:11,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632467834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:11,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:11,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:47:11,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916201442] [2022-11-16 12:47:11,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:11,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:47:11,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:11,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:47:11,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:47:11,600 INFO L87 Difference]: Start difference. First operand 7946 states and 31748 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:11,840 INFO L93 Difference]: Finished difference Result 4127 states and 15962 transitions. [2022-11-16 12:47:11,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:47:11,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-16 12:47:11,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:11,869 INFO L225 Difference]: With dead ends: 4127 [2022-11-16 12:47:11,870 INFO L226 Difference]: Without dead ends: 4127 [2022-11-16 12:47:11,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:47:11,874 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:11,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:47:11,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2022-11-16 12:47:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 4127. [2022-11-16 12:47:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4127 states, 4093 states have (on average 3.8998289763010017) internal successors, (15962), 4126 states have internal predecessors, (15962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4127 states to 4127 states and 15962 transitions. [2022-11-16 12:47:12,044 INFO L78 Accepts]: Start accepts. Automaton has 4127 states and 15962 transitions. Word has length 3 [2022-11-16 12:47:12,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:12,044 INFO L495 AbstractCegarLoop]: Abstraction has 4127 states and 15962 transitions. [2022-11-16 12:47:12,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:12,045 INFO L276 IsEmpty]: Start isEmpty. Operand 4127 states and 15962 transitions. [2022-11-16 12:47:12,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:47:12,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:12,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:12,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:12,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:12,269 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:47:12,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:12,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1354976911, now seen corresponding path program 1 times [2022-11-16 12:47:12,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:12,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721789641] [2022-11-16 12:47:12,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:12,271 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-16 12:47:12,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:12,272 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:12,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:12,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:47:12,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:12,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:12,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:12,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721789641] [2022-11-16 12:47:12,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721789641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:12,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:12,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:47:12,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396241777] [2022-11-16 12:47:12,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:12,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:47:12,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:12,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:47:12,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:47:12,644 INFO L87 Difference]: Start difference. First operand 4127 states and 15962 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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-16 12:47:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:12,949 INFO L93 Difference]: Finished difference Result 2847 states and 9710 transitions. [2022-11-16 12:47:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:47:12,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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-16 12:47:12,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:12,967 INFO L225 Difference]: With dead ends: 2847 [2022-11-16 12:47:12,968 INFO L226 Difference]: Without dead ends: 2847 [2022-11-16 12:47:12,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:47:12,973 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:12,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:47:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2022-11-16 12:47:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2847. [2022-11-16 12:47:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2847 states, 2813 states have (on average 3.451830785638109) internal successors, (9710), 2846 states have internal predecessors, (9710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 9710 transitions. [2022-11-16 12:47:13,084 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 9710 transitions. Word has length 13 [2022-11-16 12:47:13,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:13,086 INFO L495 AbstractCegarLoop]: Abstraction has 2847 states and 9710 transitions. [2022-11-16 12:47:13,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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-16 12:47:13,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 9710 transitions. [2022-11-16 12:47:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:47:13,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:13,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:13,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:13,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:13,311 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:47:13,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:13,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1660354500, now seen corresponding path program 1 times [2022-11-16 12:47:13,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:13,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534516793] [2022-11-16 12:47:13,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:13,313 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-16 12:47:13,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:13,318 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:13,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:13,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:47:13,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:13,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:13,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:13,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534516793] [2022-11-16 12:47:13,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534516793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:13,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:13,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:47:13,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078714952] [2022-11-16 12:47:13,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:13,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:47:13,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:13,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:47:13,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:47:13,682 INFO L87 Difference]: Start difference. First operand 2847 states and 9710 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-16 12:47:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:14,062 INFO L93 Difference]: Finished difference Result 1253 states and 3498 transitions. [2022-11-16 12:47:14,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:47:14,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-16 12:47:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:14,069 INFO L225 Difference]: With dead ends: 1253 [2022-11-16 12:47:14,069 INFO L226 Difference]: Without dead ends: 1253 [2022-11-16 12:47:14,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-16 12:47:14,070 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:14,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 8 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:47:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2022-11-16 12:47:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1253. [2022-11-16 12:47:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1225 states have (on average 2.8555102040816327) internal successors, (3498), 1252 states have internal predecessors, (3498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 3498 transitions. [2022-11-16 12:47:14,187 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 3498 transitions. Word has length 15 [2022-11-16 12:47:14,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:14,187 INFO L495 AbstractCegarLoop]: Abstraction has 1253 states and 3498 transitions. [2022-11-16 12:47:14,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-16 12:47:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 3498 transitions. [2022-11-16 12:47:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:47:14,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:14,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:14,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:14,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:14,407 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:47:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash 425163505, now seen corresponding path program 1 times [2022-11-16 12:47:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:14,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776356720] [2022-11-16 12:47:14,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:14,409 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-16 12:47:14,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:14,410 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:14,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:14,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:47:14,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:14,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:14,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:14,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776356720] [2022-11-16 12:47:14,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776356720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:14,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:14,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:47:14,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292560594] [2022-11-16 12:47:14,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:14,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:47:14,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:14,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:47:14,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:47:14,777 INFO L87 Difference]: Start difference. First operand 1253 states and 3498 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:15,364 INFO L93 Difference]: Finished difference Result 536 states and 1408 transitions. [2022-11-16 12:47:15,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:47:15,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 12:47:15,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:15,367 INFO L225 Difference]: With dead ends: 536 [2022-11-16 12:47:15,368 INFO L226 Difference]: Without dead ends: 536 [2022-11-16 12:47:15,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-16 12:47:15,369 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:15,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 18 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:47:15,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-11-16 12:47:15,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2022-11-16 12:47:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 522 states have (on average 2.6973180076628354) internal successors, (1408), 535 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:15,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1408 transitions. [2022-11-16 12:47:15,386 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1408 transitions. Word has length 18 [2022-11-16 12:47:15,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:15,387 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 1408 transitions. [2022-11-16 12:47:15,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:15,387 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1408 transitions. [2022-11-16 12:47:15,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 12:47:15,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:15,390 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-16 12:47:15,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:15,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:15,606 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:47:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:15,606 INFO L85 PathProgramCache]: Analyzing trace with hash -678917917, now seen corresponding path program 1 times [2022-11-16 12:47:15,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:15,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338999894] [2022-11-16 12:47:15,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:15,607 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-16 12:47:15,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:15,609 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:15,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:15,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 12:47:15,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:16,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:16,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:16,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338999894] [2022-11-16 12:47:16,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338999894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:16,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:16,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:47:16,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230921463] [2022-11-16 12:47:16,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:16,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:47:16,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:16,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:47:16,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:47:16,011 INFO L87 Difference]: Start difference. First operand 536 states and 1408 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:16,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:16,727 INFO L93 Difference]: Finished difference Result 396 states and 1136 transitions. [2022-11-16 12:47:16,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:47:16,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 12:47:16,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:16,730 INFO L225 Difference]: With dead ends: 396 [2022-11-16 12:47:16,731 INFO L226 Difference]: Without dead ends: 396 [2022-11-16 12:47:16,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:47:16,732 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 41 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:16,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 28 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:47:16,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-11-16 12:47:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2022-11-16 12:47:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 392 states have (on average 2.8979591836734695) internal successors, (1136), 395 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1136 transitions. [2022-11-16 12:47:16,746 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1136 transitions. Word has length 21 [2022-11-16 12:47:16,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:16,746 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 1136 transitions. [2022-11-16 12:47:16,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1136 transitions. [2022-11-16 12:47:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 12:47:16,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:16,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:16,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:16,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:16,964 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:47:16,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:16,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2138909261, now seen corresponding path program 1 times [2022-11-16 12:47:16,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:16,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986180687] [2022-11-16 12:47:16,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:16,966 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-16 12:47:16,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:16,968 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:17,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:17,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:47:17,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:18,639 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 72 treesize of output 68 [2022-11-16 12:47:18,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-16 12:47:18,915 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:18,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:18,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986180687] [2022-11-16 12:47:18,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986180687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:18,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:18,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:47:18,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30930670] [2022-11-16 12:47:18,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:18,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:47:18,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:18,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:47:18,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:47:18,918 INFO L87 Difference]: Start difference. First operand 396 states and 1136 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:19,256 INFO L93 Difference]: Finished difference Result 394 states and 1134 transitions. [2022-11-16 12:47:19,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:47:19,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 12:47:19,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:19,259 INFO L225 Difference]: With dead ends: 394 [2022-11-16 12:47:19,259 INFO L226 Difference]: Without dead ends: 394 [2022-11-16 12:47:19,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:47:19,260 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 49 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:19,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 3 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:47:19,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-11-16 12:47:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2022-11-16 12:47:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 392 states have (on average 2.892857142857143) internal successors, (1134), 393 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1134 transitions. [2022-11-16 12:47:19,278 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1134 transitions. Word has length 24 [2022-11-16 12:47:19,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:19,279 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 1134 transitions. [2022-11-16 12:47:19,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1134 transitions. [2022-11-16 12:47:19,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:47:19,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:19,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:19,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:19,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:19,495 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:47:19,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:19,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1881684474, now seen corresponding path program 1 times [2022-11-16 12:47:19,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:19,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975585911] [2022-11-16 12:47:19,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:19,497 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-16 12:47:19,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:19,499 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:19,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:19,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:47:19,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:19,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:19,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:19,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975585911] [2022-11-16 12:47:19,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975585911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:19,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:19,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:47:19,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88706463] [2022-11-16 12:47:19,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:19,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:47:19,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:19,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:47:19,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:47:19,963 INFO L87 Difference]: Start difference. First operand 394 states and 1134 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:20,349 INFO L93 Difference]: Finished difference Result 525 states and 1457 transitions. [2022-11-16 12:47:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:47:20,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-16 12:47:20,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:20,353 INFO L225 Difference]: With dead ends: 525 [2022-11-16 12:47:20,353 INFO L226 Difference]: Without dead ends: 525 [2022-11-16 12:47:20,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:47:20,354 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:20,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 7 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:47:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-11-16 12:47:20,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 520. [2022-11-16 12:47:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 518 states have (on average 2.805019305019305) internal successors, (1453), 519 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1453 transitions. [2022-11-16 12:47:20,379 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1453 transitions. Word has length 25 [2022-11-16 12:47:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:20,380 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 1453 transitions. [2022-11-16 12:47:20,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1453 transitions. [2022-11-16 12:47:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:47:20,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:20,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:20,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:20,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:20,599 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:47:20,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2050546700, now seen corresponding path program 2 times [2022-11-16 12:47:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:20,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068665897] [2022-11-16 12:47:20,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:47:20,600 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-16 12:47:20,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:20,602 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:20,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:20,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 12:47:21,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:47:21,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:47:21,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:21,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:21,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:21,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068665897] [2022-11-16 12:47:21,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068665897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:21,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:21,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:47:21,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080980599] [2022-11-16 12:47:21,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:21,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:47:21,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:21,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:47:21,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:47:21,083 INFO L87 Difference]: Start difference. First operand 520 states and 1453 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:21,447 INFO L93 Difference]: Finished difference Result 781 states and 2141 transitions. [2022-11-16 12:47:21,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:47:21,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-16 12:47:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:21,451 INFO L225 Difference]: With dead ends: 781 [2022-11-16 12:47:21,451 INFO L226 Difference]: Without dead ends: 781 [2022-11-16 12:47:21,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:47:21,452 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:21,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:47:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-11-16 12:47:21,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 520. [2022-11-16 12:47:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 518 states have (on average 2.805019305019305) internal successors, (1453), 519 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1453 transitions. [2022-11-16 12:47:21,481 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1453 transitions. Word has length 25 [2022-11-16 12:47:21,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:21,482 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 1453 transitions. [2022-11-16 12:47:21,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1453 transitions. [2022-11-16 12:47:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:47:21,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:21,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:21,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:21,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:21,699 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:47:21,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:21,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1956419724, now seen corresponding path program 3 times [2022-11-16 12:47:21,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:21,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849709929] [2022-11-16 12:47:21,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:47:21,700 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-16 12:47:21,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:21,701 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:21,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:22,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 12:47:22,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:47:22,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 12:47:22,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:22,181 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-16 12:47:22,250 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-16 12:47:22,492 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-16 12:47:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:22,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:22,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:22,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849709929] [2022-11-16 12:47:22,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849709929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:22,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:22,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:47:22,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337489592] [2022-11-16 12:47:22,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:22,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:47:22,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:22,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:47:22,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:47:22,529 INFO L87 Difference]: Start difference. First operand 520 states and 1453 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:23,255 INFO L93 Difference]: Finished difference Result 838 states and 2255 transitions. [2022-11-16 12:47:23,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:47:23,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-16 12:47:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:23,259 INFO L225 Difference]: With dead ends: 838 [2022-11-16 12:47:23,260 INFO L226 Difference]: Without dead ends: 838 [2022-11-16 12:47:23,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 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-16 12:47:23,261 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 43 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:23,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 11 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:47:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-11-16 12:47:23,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 529. [2022-11-16 12:47:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 527 states have (on average 2.81404174573055) internal successors, (1483), 528 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1483 transitions. [2022-11-16 12:47:23,282 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1483 transitions. Word has length 25 [2022-11-16 12:47:23,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:23,283 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 1483 transitions. [2022-11-16 12:47:23,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1483 transitions. [2022-11-16 12:47:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:47:23,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:23,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:23,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:23,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:23,502 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-16 12:47:23,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:23,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1357169182, now seen corresponding path program 4 times [2022-11-16 12:47:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:23,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761196333] [2022-11-16 12:47:23,503 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:47:23,503 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-16 12:47:23,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:23,505 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:23,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:23,983 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:47:23,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 12:47:23,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:47:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:47:24,294 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 12:47:24,294 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:47:24,295 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (79 of 80 remaining) [2022-11-16 12:47:24,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2022-11-16 12:47:24,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 80 remaining) [2022-11-16 12:47:24,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 80 remaining) [2022-11-16 12:47:24,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 80 remaining) [2022-11-16 12:47:24,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 80 remaining) [2022-11-16 12:47:24,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2022-11-16 12:47:24,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2022-11-16 12:47:24,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2022-11-16 12:47:24,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 80 remaining) [2022-11-16 12:47:24,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2022-11-16 12:47:24,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2022-11-16 12:47:24,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2022-11-16 12:47:24,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2022-11-16 12:47:24,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 80 remaining) [2022-11-16 12:47:24,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2022-11-16 12:47:24,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2022-11-16 12:47:24,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2022-11-16 12:47:24,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 80 remaining) [2022-11-16 12:47:24,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2022-11-16 12:47:24,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 80 remaining) [2022-11-16 12:47:24,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 80 remaining) [2022-11-16 12:47:24,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2022-11-16 12:47:24,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2022-11-16 12:47:24,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2022-11-16 12:47:24,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2022-11-16 12:47:24,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2022-11-16 12:47:24,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 80 remaining) [2022-11-16 12:47:24,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 80 remaining) [2022-11-16 12:47:24,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 80 remaining) [2022-11-16 12:47:24,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 80 remaining) [2022-11-16 12:47:24,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 80 remaining) [2022-11-16 12:47:24,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 80 remaining) [2022-11-16 12:47:24,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2022-11-16 12:47:24,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2022-11-16 12:47:24,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2022-11-16 12:47:24,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2022-11-16 12:47:24,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 80 remaining) [2022-11-16 12:47:24,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 80 remaining) [2022-11-16 12:47:24,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 80 remaining) [2022-11-16 12:47:24,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 80 remaining) [2022-11-16 12:47:24,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 80 remaining) [2022-11-16 12:47:24,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 80 remaining) [2022-11-16 12:47:24,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 80 remaining) [2022-11-16 12:47:24,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 80 remaining) [2022-11-16 12:47:24,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (34 of 80 remaining) [2022-11-16 12:47:24,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 80 remaining) [2022-11-16 12:47:24,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 80 remaining) [2022-11-16 12:47:24,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 80 remaining) [2022-11-16 12:47:24,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 80 remaining) [2022-11-16 12:47:24,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 80 remaining) [2022-11-16 12:47:24,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 80 remaining) [2022-11-16 12:47:24,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 80 remaining) [2022-11-16 12:47:24,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2022-11-16 12:47:24,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2022-11-16 12:47:24,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 80 remaining) [2022-11-16 12:47:24,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2022-11-16 12:47:24,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2022-11-16 12:47:24,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2022-11-16 12:47:24,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 80 remaining) [2022-11-16 12:47:24,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2022-11-16 12:47:24,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2022-11-16 12:47:24,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 80 remaining) [2022-11-16 12:47:24,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 80 remaining) [2022-11-16 12:47:24,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 80 remaining) [2022-11-16 12:47:24,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2022-11-16 12:47:24,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2022-11-16 12:47:24,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 80 remaining) [2022-11-16 12:47:24,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2022-11-16 12:47:24,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2022-11-16 12:47:24,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 80 remaining) [2022-11-16 12:47:24,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 80 remaining) [2022-11-16 12:47:24,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 80 remaining) [2022-11-16 12:47:24,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 80 remaining) [2022-11-16 12:47:24,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2022-11-16 12:47:24,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2022-11-16 12:47:24,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 80 remaining) [2022-11-16 12:47:24,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 80 remaining) [2022-11-16 12:47:24,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 80 remaining) [2022-11-16 12:47:24,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 80 remaining) [2022-11-16 12:47:24,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:24,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/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-16 12:47:24,532 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:24,538 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:47:24,539 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:47:24,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:47:24 BasicIcfg [2022-11-16 12:47:24,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:47:24,696 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:47:24,696 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:47:24,696 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:47:24,697 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:12" (3/4) ... [2022-11-16 12:47:24,700 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 12:47:24,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:47:24,701 INFO L158 Benchmark]: Toolchain (without parser) took 75320.68ms. Allocated memory was 58.7MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 36.2MB in the beginning and 7.8GB in the end (delta: -7.8GB). Peak memory consumption was 662.7MB. Max. memory is 16.1GB. [2022-11-16 12:47:24,702 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 58.7MB. Free memory is still 40.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:47:24,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 892.44ms. Allocated memory is still 58.7MB. Free memory was 36.0MB in the beginning and 28.6MB in the end (delta: 7.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 12:47:24,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.44ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 28.6MB in the beginning and 58.2MB in the end (delta: -29.6MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-11-16 12:47:24,703 INFO L158 Benchmark]: Boogie Preprocessor took 91.88ms. Allocated memory is still 75.5MB. Free memory was 58.2MB in the beginning and 55.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:47:24,703 INFO L158 Benchmark]: RCFGBuilder took 2109.53ms. Allocated memory was 75.5MB in the beginning and 107.0MB in the end (delta: 31.5MB). Free memory was 55.4MB in the beginning and 70.6MB in the end (delta: -15.2MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2022-11-16 12:47:24,704 INFO L158 Benchmark]: TraceAbstraction took 72080.74ms. Allocated memory was 107.0MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 70.2MB in the beginning and 7.8GB in the end (delta: -7.7GB). Peak memory consumption was 650.1MB. Max. memory is 16.1GB. [2022-11-16 12:47:24,704 INFO L158 Benchmark]: Witness Printer took 5.00ms. Allocated memory is still 8.5GB. Free memory is still 7.8GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:47:24,706 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.96ms. Allocated memory is still 58.7MB. Free memory is still 40.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 892.44ms. Allocated memory is still 58.7MB. Free memory was 36.0MB in the beginning and 28.6MB in the end (delta: 7.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.44ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 28.6MB in the beginning and 58.2MB in the end (delta: -29.6MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.88ms. Allocated memory is still 75.5MB. Free memory was 58.2MB in the beginning and 55.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2109.53ms. Allocated memory was 75.5MB in the beginning and 107.0MB in the end (delta: 31.5MB). Free memory was 55.4MB in the beginning and 70.6MB in the end (delta: -15.2MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * TraceAbstraction took 72080.74ms. Allocated memory was 107.0MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 70.2MB in the beginning and 7.8GB in the end (delta: -7.7GB). Peak memory consumption was 650.1MB. Max. memory is 16.1GB. * Witness Printer took 5.00ms. Allocated memory is still 8.5GB. Free memory is still 7.8GB. 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: 46.0s, 210 PlacesBefore, 92 PlacesAfterwards, 199 TransitionsBefore, 80 TransitionsAfterwards, 8132 CoEnabledTransitionPairs, 8 FixpointIterations, 75 TrivialSequentialCompositions, 104 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 186 TotalNumberOfCompositions, 25942 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12019, independent: 11594, independent conditional: 0, independent unconditional: 11594, dependent: 263, dependent conditional: 0, dependent unconditional: 263, unknown: 162, unknown conditional: 0, unknown unconditional: 162] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5284, independent: 5198, independent conditional: 0, independent unconditional: 5198, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5284, independent: 4671, independent conditional: 0, independent unconditional: 4671, dependent: 613, dependent conditional: 0, dependent unconditional: 613, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 613, independent: 527, independent conditional: 0, independent unconditional: 527, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5221, independent: 2883, independent conditional: 0, independent unconditional: 2883, dependent: 1084, dependent conditional: 0, dependent unconditional: 1084, unknown: 1254, unknown conditional: 0, unknown unconditional: 1254] ], Cache Queries: [ total: 12019, independent: 6396, independent conditional: 0, independent unconditional: 6396, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 5423, unknown conditional: 0, unknown unconditional: 5423] , Statistics on independence cache: Total cache size (in pairs): 586, Positive cache size: 564, Positive conditional cache size: 0, Positive unconditional cache size: 564, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 16, Unknown conditional cache size: 0, Unknown unconditional cache size: 16 - 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: [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L758] 0 int y$w_buff0; [L760] 0 int y$w_buff1; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L745] 0 int y$mem_tmp; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L756] 0 _Bool y$read_delayed; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L711] 0 int __unbuffered_cnt = 0; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L761] 0 _Bool y$w_buff1_used; [L757] 0 int *y$read_delayed_var; [L737] 0 int __unbuffered_p2_EBX = 0; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L713] 0 int __unbuffered_p0_EAX = 0; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L735] 0 int __unbuffered_p2_EAX = 0; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L744] 0 _Bool y$flush_delayed; [L733] 0 int __unbuffered_p0_EBX = 0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L739] 0 _Bool main$tmp_guard1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L738] 0 _Bool main$tmp_guard0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L759] 0 _Bool y$w_buff0_used; [L741] 0 int x = 0; [L751] 0 _Bool y$r_buff1_thd0; [L743] 0 int y = 0; [L753] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd1; [L755] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$r_buff1_thd3; [L863] 0 pthread_t t2433; [L864] FCALL, FORK 0 pthread_create(&t2433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2433, ((void *)0), P0, ((void *)0))=-1, t2433={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L772] EXPR 1 \read(y) [L772] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L772] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L773] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L774] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L775] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L776] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L778] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L779] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L780] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L781] EXPR 1 \read(y) [L781] 1 __unbuffered_p0_EAX = y [L782] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L782] EXPR 1 \read(y) [L782] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L782] 1 y = y$flush_delayed ? y$mem_tmp : y [L783] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L865] 0 pthread_t t2434; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2433={15:0}, t2434={-2147483641:0}, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L866] FCALL, FORK 0 pthread_create(&t2434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2434, ((void *)0), P1, ((void *)0))=0, t2433={15:0}, t2434={-2147483641:0}, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L867] 0 pthread_t t2435; [L868] FCALL, FORK 0 pthread_create(&t2435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2435, ((void *)0), P2, ((void *)0))=1, t2433={15:0}, t2434={-2147483641:0}, t2435={7:0}, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L869] 0 pthread_t t2436; [L870] FCALL, FORK 0 pthread_create(&t2436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2436, ((void *)0), P3, ((void *)0))=2, t2433={15:0}, t2434={-2147483641:0}, t2435={7:0}, t2436={5:0}, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=6, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L814] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L815] 3 y$flush_delayed = weak$$choice2 [L816] EXPR 3 \read(y) [L816] 3 y$mem_tmp = y [L817] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] EXPR 3 \read(y) [L817] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L819] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L820] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L821] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L823] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 \read(y) [L824] 3 __unbuffered_p2_EBX = y [L825] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L825] EXPR 3 \read(y) [L825] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L825] 3 y = y$flush_delayed ? y$mem_tmp : y [L826] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 4 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L841] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L841] EXPR 4 \read(y) [L841] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L841] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L850] 4 return 0; [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L791] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 1 return 0; [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L876] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L876] EXPR 0 \read(y) [L876] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L876] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L876] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2433={15:0}, t2434={-2147483641:0}, t2435={7:0}, t2436={5:0}, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L887] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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=7, weak$$choice1=2, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 861]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 866]: 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: 864]: 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: 868]: 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: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 259 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 71.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.2s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 52.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1343 IncrementalHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 34 mSDtfsCounter, 1343 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127008occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 575 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 940 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1844 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 12:47:24,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08b330ce-ce5c-4684-8716-33fcf9ae85ba/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample