./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:58:32,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:58:32,951 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 04:58:32,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:58:32,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:58:32,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:58:32,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:58:32,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:58:32,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:58:32,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:58:32,987 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:58:32,987 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:58:32,988 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:58:32,988 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:58:32,989 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:58:32,990 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:58:32,990 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:58:32,991 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:58:32,991 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:58:32,992 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:58:32,992 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:58:32,993 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:58:32,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 04:58:32,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 04:58:32,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:58:32,996 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:58:32,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:58:32,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:58:32,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:58:32,998 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 04:58:32,998 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 04:58:32,999 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 04:58:32,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:58:32,999 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 04:58:33,000 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 04:58:33,000 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:58:33,001 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:58:33,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:58:33,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:58:33,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:58:33,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:58:33,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:58:33,002 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:58:33,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:58:33,003 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:58:33,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:58:33,003 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/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_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae [2023-11-19 04:58:33,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:58:33,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:58:33,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:58:33,321 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:58:33,323 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:58:33,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 04:58:36,488 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:58:36,756 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:58:36,767 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 04:58:36,792 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/data/c7b64f66a/51609a4eac60418d872d34a74a0e5be7/FLAG3c8f19e6b [2023-11-19 04:58:36,808 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/data/c7b64f66a/51609a4eac60418d872d34a74a0e5be7 [2023-11-19 04:58:36,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:58:36,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:58:36,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:58:36,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:58:36,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:58:36,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:58:36" (1/1) ... [2023-11-19 04:58:36,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb5f6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:36, skipping insertion in model container [2023-11-19 04:58:36,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:58:36" (1/1) ... [2023-11-19 04:58:36,913 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:58:37,390 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:58:37,405 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:58:37,481 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:58:37,519 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:58:37,520 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:58:37,528 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:58:37,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:37 WrapperNode [2023-11-19 04:58:37,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:58:37,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:58:37,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:58:37,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:58:37,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:37" (1/1) ... [2023-11-19 04:58:37,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:37" (1/1) ... [2023-11-19 04:58:37,587 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125 [2023-11-19 04:58:37,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:58:37,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:58:37,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:58:37,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:58:37,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:37" (1/1) ... [2023-11-19 04:58:37,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:37" (1/1) ... [2023-11-19 04:58:37,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:37" (1/1) ... [2023-11-19 04:58:37,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:37" (1/1) ... [2023-11-19 04:58:37,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:37" (1/1) ... [2023-11-19 04:58:37,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:37" (1/1) ... [2023-11-19 04:58:37,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:37" (1/1) ... [2023-11-19 04:58:37,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:37" (1/1) ... [2023-11-19 04:58:37,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:58:37,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:58:37,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:58:37,666 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:58:37,667 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:37" (1/1) ... [2023-11-19 04:58:37,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:58:37,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:58:37,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:58:37,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:58:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:58:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 04:58:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:58:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:58:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:58:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 04:58:37,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 04:58:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 04:58:37,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 04:58:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:58:37,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 04:58:37,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:58:37,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:58:37,803 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 04:58:38,057 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:58:38,060 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:58:38,483 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:58:38,713 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:58:38,713 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 04:58:38,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:58:38 BoogieIcfgContainer [2023-11-19 04:58:38,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:58:38,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:58:38,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:58:38,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:58:38,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:58:36" (1/3) ... [2023-11-19 04:58:38,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e94eca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:58:38, skipping insertion in model container [2023-11-19 04:58:38,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:37" (2/3) ... [2023-11-19 04:58:38,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e94eca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:58:38, skipping insertion in model container [2023-11-19 04:58:38,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:58:38" (3/3) ... [2023-11-19 04:58:38,727 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 04:58:38,750 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:58:38,750 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-19 04:58:38,750 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 04:58:38,802 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 04:58:38,842 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:58:38,860 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 110 transitions, 228 flow [2023-11-19 04:58:38,864 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 110 transitions, 228 flow [2023-11-19 04:58:38,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 110 transitions, 228 flow [2023-11-19 04:58:38,929 INFO L124 PetriNetUnfolderBase]: 5/108 cut-off events. [2023-11-19 04:58:38,929 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 04:58:38,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 108 events. 5/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 70. Up to 3 conditions per place. [2023-11-19 04:58:38,938 INFO L119 LiptonReduction]: Number of co-enabled transitions 1896 [2023-11-19 04:58:44,101 INFO L134 LiptonReduction]: Checked pairs total: 3786 [2023-11-19 04:58:44,101 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-11-19 04:58:44,110 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 28 transitions, 64 flow [2023-11-19 04:58:44,145 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 220 states, 211 states have (on average 2.7393364928909953) internal successors, (578), 219 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:44,164 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:58:44,171 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;@6ecaeabe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:58:44,171 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-19 04:58:44,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 211 states have (on average 2.7393364928909953) internal successors, (578), 219 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-19 04:58:44,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:58:44,179 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-19 04:58:44,180 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:58:44,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:58:44,185 INFO L85 PathProgramCache]: Analyzing trace with hash 506, now seen corresponding path program 1 times [2023-11-19 04:58:44,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:58:44,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210475511] [2023-11-19 04:58:44,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:58:44,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:58:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:58:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:58:44,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:58:44,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210475511] [2023-11-19 04:58:44,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210475511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:58:44,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:58:44,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 04:58:44,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104717642] [2023-11-19 04:58:44,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:58:44,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 04:58:44,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:58:44,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 04:58:44,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:58:44,366 INFO L87 Difference]: Start difference. First operand has 220 states, 211 states have (on average 2.7393364928909953) internal successors, (578), 219 states have internal predecessors, (578), 0 states have call successors, (0), 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) [2023-11-19 04:58:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:58:44,443 INFO L93 Difference]: Finished difference Result 210 states and 506 transitions. [2023-11-19 04:58:44,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 04:58:44,446 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 [2023-11-19 04:58:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:58:44,462 INFO L225 Difference]: With dead ends: 210 [2023-11-19 04:58:44,462 INFO L226 Difference]: Without dead ends: 210 [2023-11-19 04:58:44,464 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 [2023-11-19 04:58:44,469 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:58:44,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:58:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-11-19 04:58:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2023-11-19 04:58:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 2.4682926829268292) internal successors, (506), 209 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 506 transitions. [2023-11-19 04:58:44,550 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 506 transitions. Word has length 1 [2023-11-19 04:58:44,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:58:44,551 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 506 transitions. [2023-11-19 04:58:44,551 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) [2023-11-19 04:58:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 506 transitions. [2023-11-19 04:58:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 04:58:44,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:58:44,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 04:58:44,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:58:44,557 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:58:44,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:58:44,557 INFO L85 PathProgramCache]: Analyzing trace with hash 477522753, now seen corresponding path program 1 times [2023-11-19 04:58:44,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:58:44,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802556668] [2023-11-19 04:58:44,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:58:44,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:58:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:58:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:58:44,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:58:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802556668] [2023-11-19 04:58:44,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802556668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:58:44,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:58:44,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:58:44,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696176893] [2023-11-19 04:58:44,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:58:44,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:58:44,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:58:44,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:58:44,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:58:44,973 INFO L87 Difference]: Start difference. First operand 210 states and 506 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:45,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:58:45,032 INFO L93 Difference]: Finished difference Result 182 states and 433 transitions. [2023-11-19 04:58:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:58:45,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-11-19 04:58:45,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:58:45,034 INFO L225 Difference]: With dead ends: 182 [2023-11-19 04:58:45,035 INFO L226 Difference]: Without dead ends: 178 [2023-11-19 04:58:45,035 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 [2023-11-19 04:58:45,036 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:58:45,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 6 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:58:45,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-19 04:58:45,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2023-11-19 04:58:45,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 176 states have (on average 2.4204545454545454) internal successors, (426), 177 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 426 transitions. [2023-11-19 04:58:45,049 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 426 transitions. Word has length 5 [2023-11-19 04:58:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:58:45,049 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 426 transitions. [2023-11-19 04:58:45,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 426 transitions. [2023-11-19 04:58:45,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 04:58:45,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:58:45,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:58:45,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:58:45,051 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:58:45,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:58:45,052 INFO L85 PathProgramCache]: Analyzing trace with hash 949626716, now seen corresponding path program 1 times [2023-11-19 04:58:45,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:58:45,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025169057] [2023-11-19 04:58:45,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:58:45,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:58:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:58:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:58:45,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:58:45,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025169057] [2023-11-19 04:58:45,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025169057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:58:45,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:58:45,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:58:45,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039229167] [2023-11-19 04:58:45,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:58:45,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:58:45,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:58:45,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:58:45,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:58:45,275 INFO L87 Difference]: Start difference. First operand 178 states and 426 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:58:45,408 INFO L93 Difference]: Finished difference Result 297 states and 703 transitions. [2023-11-19 04:58:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:58:45,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-19 04:58:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:58:45,413 INFO L225 Difference]: With dead ends: 297 [2023-11-19 04:58:45,413 INFO L226 Difference]: Without dead ends: 297 [2023-11-19 04:58:45,414 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 [2023-11-19 04:58:45,418 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:58:45,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:58:45,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-11-19 04:58:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 237. [2023-11-19 04:58:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 235 states have (on average 2.425531914893617) internal successors, (570), 236 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 570 transitions. [2023-11-19 04:58:45,443 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 570 transitions. Word has length 8 [2023-11-19 04:58:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:58:45,443 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 570 transitions. [2023-11-19 04:58:45,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 570 transitions. [2023-11-19 04:58:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 04:58:45,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:58:45,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:58:45,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:58:45,446 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:58:45,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:58:45,447 INFO L85 PathProgramCache]: Analyzing trace with hash 949626748, now seen corresponding path program 1 times [2023-11-19 04:58:45,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:58:45,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939628049] [2023-11-19 04:58:45,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:58:45,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:58:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:58:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:58:45,793 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:58:45,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939628049] [2023-11-19 04:58:45,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939628049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:58:45,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:58:45,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:58:45,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127614105] [2023-11-19 04:58:45,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:58:45,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:58:45,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:58:45,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:58:45,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:58:45,796 INFO L87 Difference]: Start difference. First operand 237 states and 570 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:58:45,859 INFO L93 Difference]: Finished difference Result 209 states and 476 transitions. [2023-11-19 04:58:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:58:45,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-19 04:58:45,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:58:45,861 INFO L225 Difference]: With dead ends: 209 [2023-11-19 04:58:45,861 INFO L226 Difference]: Without dead ends: 151 [2023-11-19 04:58:45,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:58:45,866 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:58:45,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:58:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-19 04:58:45,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2023-11-19 04:58:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.2133333333333334) internal successors, (332), 150 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 332 transitions. [2023-11-19 04:58:45,878 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 332 transitions. Word has length 8 [2023-11-19 04:58:45,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:58:45,878 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 332 transitions. [2023-11-19 04:58:45,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 332 transitions. [2023-11-19 04:58:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 04:58:45,881 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:58:45,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:58:45,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:58:45,883 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:58:45,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:58:45,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1933721476, now seen corresponding path program 1 times [2023-11-19 04:58:45,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:58:45,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11171327] [2023-11-19 04:58:45,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:58:45,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:58:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:58:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:58:46,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:58:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11171327] [2023-11-19 04:58:46,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11171327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:58:46,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:58:46,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:58:46,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488523190] [2023-11-19 04:58:46,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:58:46,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:58:46,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:58:46,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:58:46,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:58:46,053 INFO L87 Difference]: Start difference. First operand 151 states and 332 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:58:46,167 INFO L93 Difference]: Finished difference Result 180 states and 368 transitions. [2023-11-19 04:58:46,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:58:46,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 04:58:46,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:58:46,169 INFO L225 Difference]: With dead ends: 180 [2023-11-19 04:58:46,169 INFO L226 Difference]: Without dead ends: 129 [2023-11-19 04:58:46,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:58:46,170 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:58:46,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 6 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:58:46,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-19 04:58:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2023-11-19 04:58:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.1682242990654204) internal successors, (232), 107 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 232 transitions. [2023-11-19 04:58:46,177 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 232 transitions. Word has length 9 [2023-11-19 04:58:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:58:46,177 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 232 transitions. [2023-11-19 04:58:46,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:46,178 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 232 transitions. [2023-11-19 04:58:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 04:58:46,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:58:46,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:58:46,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:58:46,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:58:46,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:58:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1244838293, now seen corresponding path program 1 times [2023-11-19 04:58:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:58:46,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353664133] [2023-11-19 04:58:46,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:58:46,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:58:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:58:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:58:46,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:58:46,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353664133] [2023-11-19 04:58:46,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353664133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:58:46,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:58:46,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:58:46,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250727539] [2023-11-19 04:58:46,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:58:46,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:58:46,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:58:46,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:58:46,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:58:46,401 INFO L87 Difference]: Start difference. First operand 108 states and 232 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:46,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:58:46,513 INFO L93 Difference]: Finished difference Result 120 states and 243 transitions. [2023-11-19 04:58:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:58:46,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 04:58:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:58:46,515 INFO L225 Difference]: With dead ends: 120 [2023-11-19 04:58:46,515 INFO L226 Difference]: Without dead ends: 96 [2023-11-19 04:58:46,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:58:46,516 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:58:46,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 7 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:58:46,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-19 04:58:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2023-11-19 04:58:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.152173913043478) internal successors, (198), 92 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 198 transitions. [2023-11-19 04:58:46,521 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 198 transitions. Word has length 12 [2023-11-19 04:58:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:58:46,522 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 198 transitions. [2023-11-19 04:58:46,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 198 transitions. [2023-11-19 04:58:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 04:58:46,527 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:58:46,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:58:46,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 04:58:46,528 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:58:46,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:58:46,528 INFO L85 PathProgramCache]: Analyzing trace with hash 704541590, now seen corresponding path program 1 times [2023-11-19 04:58:46,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:58:46,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824987442] [2023-11-19 04:58:46,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:58:46,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:58:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:58:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:58:46,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:58:46,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824987442] [2023-11-19 04:58:46,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824987442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:58:46,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:58:46,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:58:46,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209474152] [2023-11-19 04:58:46,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:58:46,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:58:46,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:58:46,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:58:46,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:58:46,716 INFO L87 Difference]: Start difference. First operand 93 states and 198 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:58:46,777 INFO L93 Difference]: Finished difference Result 76 states and 136 transitions. [2023-11-19 04:58:46,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:58:46,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-19 04:58:46,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:58:46,778 INFO L225 Difference]: With dead ends: 76 [2023-11-19 04:58:46,778 INFO L226 Difference]: Without dead ends: 53 [2023-11-19 04:58:46,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:58:46,779 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:58:46,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:58:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-19 04:58:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-19 04:58:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 52 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 86 transitions. [2023-11-19 04:58:46,784 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 86 transitions. Word has length 13 [2023-11-19 04:58:46,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:58:46,784 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 86 transitions. [2023-11-19 04:58:46,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2023-11-19 04:58:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 04:58:46,785 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:58:46,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:58:46,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 04:58:46,786 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:58:46,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:58:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1424537318, now seen corresponding path program 1 times [2023-11-19 04:58:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:58:46,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556899210] [2023-11-19 04:58:46,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:58:46,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:58:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:58:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:58:47,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:58:47,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556899210] [2023-11-19 04:58:47,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556899210] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:58:47,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:58:47,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:58:47,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173275742] [2023-11-19 04:58:47,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:58:47,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:58:47,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:58:47,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:58:47,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:58:47,008 INFO L87 Difference]: Start difference. First operand 53 states and 86 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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) [2023-11-19 04:58:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:58:47,094 INFO L93 Difference]: Finished difference Result 79 states and 126 transitions. [2023-11-19 04:58:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:58:47,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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 [2023-11-19 04:58:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:58:47,095 INFO L225 Difference]: With dead ends: 79 [2023-11-19 04:58:47,096 INFO L226 Difference]: Without dead ends: 50 [2023-11-19 04:58:47,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:58:47,098 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:58:47,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:58:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-19 04:58:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2023-11-19 04:58:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.625) internal successors, (78), 48 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2023-11-19 04:58:47,101 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 78 transitions. Word has length 15 [2023-11-19 04:58:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:58:47,102 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 78 transitions. [2023-11-19 04:58:47,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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) [2023-11-19 04:58:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 78 transitions. [2023-11-19 04:58:47,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 04:58:47,127 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:58:47,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:58:47,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 04:58:47,128 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:58:47,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:58:47,128 INFO L85 PathProgramCache]: Analyzing trace with hash -527083002, now seen corresponding path program 2 times [2023-11-19 04:58:47,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:58:47,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831035873] [2023-11-19 04:58:47,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:58:47,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:58:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:58:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:58:47,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:58:47,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831035873] [2023-11-19 04:58:47,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831035873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:58:47,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:58:47,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:58:47,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324020835] [2023-11-19 04:58:47,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:58:47,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:58:47,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:58:47,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:58:47,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:58:47,398 INFO L87 Difference]: Start difference. First operand 49 states and 78 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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) [2023-11-19 04:58:47,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:58:47,520 INFO L93 Difference]: Finished difference Result 68 states and 107 transitions. [2023-11-19 04:58:47,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:58:47,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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 [2023-11-19 04:58:47,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:58:47,521 INFO L225 Difference]: With dead ends: 68 [2023-11-19 04:58:47,521 INFO L226 Difference]: Without dead ends: 42 [2023-11-19 04:58:47,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:58:47,522 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:58:47,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:58:47,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-19 04:58:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-19 04:58:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 65 transitions. [2023-11-19 04:58:47,524 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 65 transitions. Word has length 15 [2023-11-19 04:58:47,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:58:47,525 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 65 transitions. [2023-11-19 04:58:47,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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) [2023-11-19 04:58:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions. [2023-11-19 04:58:47,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 04:58:47,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:58:47,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:58:47,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 04:58:47,526 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:58:47,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:58:47,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1375306643, now seen corresponding path program 1 times [2023-11-19 04:58:47,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:58:47,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513808260] [2023-11-19 04:58:47,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:58:47,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:58:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:58:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:58:47,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:58:47,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513808260] [2023-11-19 04:58:47,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513808260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:58:47,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:58:47,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:58:47,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751396804] [2023-11-19 04:58:47,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:58:47,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:58:47,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:58:47,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:58:47,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:58:47,732 INFO L87 Difference]: Start difference. First operand 42 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:58:47,798 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2023-11-19 04:58:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:58:47,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-19 04:58:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:58:47,799 INFO L225 Difference]: With dead ends: 30 [2023-11-19 04:58:47,799 INFO L226 Difference]: Without dead ends: 24 [2023-11-19 04:58:47,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:58:47,800 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:58:47,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:58:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-19 04:58:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-19 04:58:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:47,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-11-19 04:58:47,803 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2023-11-19 04:58:47,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:58:47,803 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-11-19 04:58:47,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-11-19 04:58:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 04:58:47,804 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:58:47,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:58:47,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 04:58:47,805 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:58:47,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:58:47,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1254346847, now seen corresponding path program 1 times [2023-11-19 04:58:47,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:58:47,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481248633] [2023-11-19 04:58:47,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:58:47,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:58:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:58:48,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:58:48,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:58:48,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481248633] [2023-11-19 04:58:48,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481248633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:58:48,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:58:48,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:58:48,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203858416] [2023-11-19 04:58:48,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:58:48,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:58:48,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:58:48,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:58:48,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:58:48,354 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:58:48,489 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-11-19 04:58:48,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 04:58:48,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-19 04:58:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:58:48,490 INFO L225 Difference]: With dead ends: 31 [2023-11-19 04:58:48,490 INFO L226 Difference]: Without dead ends: 20 [2023-11-19 04:58:48,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:58:48,491 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:58:48,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:58:48,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-19 04:58:48,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-19 04:58:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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) [2023-11-19 04:58:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2023-11-19 04:58:48,493 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2023-11-19 04:58:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:58:48,493 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2023-11-19 04:58:48,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:58:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2023-11-19 04:58:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 04:58:48,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:58:48,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:58:48,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 04:58:48,494 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:58:48,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:58:48,495 INFO L85 PathProgramCache]: Analyzing trace with hash 423994815, now seen corresponding path program 2 times [2023-11-19 04:58:48,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:58:48,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584518325] [2023-11-19 04:58:48,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:58:48,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:58:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:58:48,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:58:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:58:48,588 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:58:48,588 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:58:48,589 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-19 04:58:48,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-19 04:58:48,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-19 04:58:48,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-19 04:58:48,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-19 04:58:48,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-19 04:58:48,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-19 04:58:48,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-19 04:58:48,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-19 04:58:48,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-19 04:58:48,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 04:58:48,595 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:58:48,600 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 04:58:48,600 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 04:58:48,649 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 04:58:48,651 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 04:58:48,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:58:48 BasicIcfg [2023-11-19 04:58:48,666 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 04:58:48,666 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 04:58:48,667 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 04:58:48,667 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 04:58:48,667 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:58:38" (3/4) ... [2023-11-19 04:58:48,669 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 04:58:48,670 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 04:58:48,671 INFO L158 Benchmark]: Toolchain (without parser) took 11851.61ms. Allocated memory was 157.3MB in the beginning and 257.9MB in the end (delta: 100.7MB). Free memory was 112.4MB in the beginning and 103.4MB in the end (delta: 9.0MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. [2023-11-19 04:58:48,671 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:58:48,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 704.20ms. Allocated memory is still 157.3MB. Free memory was 112.1MB in the beginning and 89.5MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-19 04:58:48,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.24ms. Allocated memory is still 157.3MB. Free memory was 89.5MB in the beginning and 86.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 04:58:48,672 INFO L158 Benchmark]: Boogie Preprocessor took 76.23ms. Allocated memory is still 157.3MB. Free memory was 86.9MB in the beginning and 85.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:58:48,673 INFO L158 Benchmark]: RCFGBuilder took 1051.25ms. Allocated memory is still 157.3MB. Free memory was 85.1MB in the beginning and 99.8MB in the end (delta: -14.7MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2023-11-19 04:58:48,673 INFO L158 Benchmark]: TraceAbstraction took 9946.74ms. Allocated memory was 157.3MB in the beginning and 257.9MB in the end (delta: 100.7MB). Free memory was 98.8MB in the beginning and 104.4MB in the end (delta: -5.6MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. [2023-11-19 04:58:48,673 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 257.9MB. Free memory was 104.4MB in the beginning and 103.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:58:48,675 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 704.20ms. Allocated memory is still 157.3MB. Free memory was 112.1MB in the beginning and 89.5MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.24ms. Allocated memory is still 157.3MB. Free memory was 89.5MB in the beginning and 86.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.23ms. Allocated memory is still 157.3MB. Free memory was 86.9MB in the beginning and 85.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1051.25ms. Allocated memory is still 157.3MB. Free memory was 85.1MB in the beginning and 99.8MB in the end (delta: -14.7MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9946.74ms. Allocated memory was 157.3MB in the beginning and 257.9MB in the end (delta: 100.7MB). Free memory was 98.8MB in the beginning and 104.4MB in the end (delta: -5.6MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 257.9MB. Free memory was 104.4MB in the beginning and 103.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 112 PlacesBefore, 33 PlacesAfterwards, 110 TransitionsBefore, 28 TransitionsAfterwards, 1896 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 3 ChoiceCompositions, 117 TotalNumberOfCompositions, 3786 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2049, independent: 1928, independent conditional: 0, independent unconditional: 1928, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1319, independent: 1287, independent conditional: 0, independent unconditional: 1287, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1319, independent: 1259, independent conditional: 0, independent unconditional: 1259, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 366, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2049, independent: 641, independent conditional: 0, independent unconditional: 641, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 1319, unknown conditional: 0, unknown unconditional: 1319] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 128 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 574 IncrementalHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 28 mSDtfsCounter, 574 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=3, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 85 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 801 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 04:58:48,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:58:51,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:58:51,437 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-19 04:58:51,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:58:51,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:58:51,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:58:51,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:58:51,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:58:51,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:58:51,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:58:51,499 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:58:51,499 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:58:51,500 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:58:51,501 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:58:51,502 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:58:51,502 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:58:51,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 04:58:51,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 04:58:51,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:58:51,505 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:58:51,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:58:51,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:58:51,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:58:51,507 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 04:58:51,507 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 04:58:51,508 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 04:58:51,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:58:51,508 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 04:58:51,509 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 04:58:51,509 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 04:58:51,511 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 04:58:51,511 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:58:51,511 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:58:51,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:58:51,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 04:58:51,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:58:51,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:58:51,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:58:51,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:58:51,514 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-19 04:58:51,514 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 04:58:51,515 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:58:51,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:58:51,515 INFO L153 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_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/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_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae [2023-11-19 04:58:51,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:58:51,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:58:51,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:58:51,989 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:58:51,990 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:58:51,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 04:58:55,157 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:58:55,550 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:58:55,552 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 04:58:55,574 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/data/bd0f45e0d/2e386edb6e1d4700948749996dcefe57/FLAG4cdaade6e [2023-11-19 04:58:55,589 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/data/bd0f45e0d/2e386edb6e1d4700948749996dcefe57 [2023-11-19 04:58:55,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:58:55,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:58:55,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:58:55,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:58:55,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:58:55,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:58:55" (1/1) ... [2023-11-19 04:58:55,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4ae5b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:55, skipping insertion in model container [2023-11-19 04:58:55,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:58:55" (1/1) ... [2023-11-19 04:58:55,656 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:58:56,099 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:58:56,120 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:58:56,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:58:56,275 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:58:56,275 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:58:56,284 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:58:56,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:56 WrapperNode [2023-11-19 04:58:56,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:58:56,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:58:56,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:58:56,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:58:56,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:56" (1/1) ... [2023-11-19 04:58:56,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:56" (1/1) ... [2023-11-19 04:58:56,381 INFO L138 Inliner]: procedures = 178, calls = 48, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126 [2023-11-19 04:58:56,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:58:56,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:58:56,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:58:56,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:58:56,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:56" (1/1) ... [2023-11-19 04:58:56,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:56" (1/1) ... [2023-11-19 04:58:56,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:56" (1/1) ... [2023-11-19 04:58:56,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:56" (1/1) ... [2023-11-19 04:58:56,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:56" (1/1) ... [2023-11-19 04:58:56,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:56" (1/1) ... [2023-11-19 04:58:56,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:56" (1/1) ... [2023-11-19 04:58:56,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:56" (1/1) ... [2023-11-19 04:58:56,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:58:56,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:58:56,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:58:56,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:58:56,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:56" (1/1) ... [2023-11-19 04:58:56,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:58:56,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:58:56,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:58:56,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:58:56,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 04:58:56,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:58:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:58:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:58:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 04:58:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 04:58:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 04:58:56,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 04:58:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 04:58:56,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 04:58:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 04:58:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:58:56,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:58:56,566 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 04:58:56,744 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:58:56,749 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:58:57,108 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:58:57,343 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:58:57,344 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 04:58:57,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:58:57 BoogieIcfgContainer [2023-11-19 04:58:57,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:58:57,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:58:57,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:58:57,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:58:57,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:58:55" (1/3) ... [2023-11-19 04:58:57,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b75d50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:58:57, skipping insertion in model container [2023-11-19 04:58:57,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:58:56" (2/3) ... [2023-11-19 04:58:57,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b75d50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:58:57, skipping insertion in model container [2023-11-19 04:58:57,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:58:57" (3/3) ... [2023-11-19 04:58:57,358 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 04:58:57,378 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:58:57,378 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-19 04:58:57,378 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 04:58:57,483 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 04:58:57,527 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:58:57,551 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 111 transitions, 230 flow [2023-11-19 04:58:57,555 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 111 transitions, 230 flow [2023-11-19 04:58:57,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 111 transitions, 230 flow [2023-11-19 04:58:57,620 INFO L124 PetriNetUnfolderBase]: 5/109 cut-off events. [2023-11-19 04:58:57,620 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 04:58:57,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 109 events. 5/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 70. Up to 3 conditions per place. [2023-11-19 04:58:57,629 INFO L119 LiptonReduction]: Number of co-enabled transitions 1896 [2023-11-19 04:59:04,705 INFO L134 LiptonReduction]: Checked pairs total: 3982 [2023-11-19 04:59:04,706 INFO L136 LiptonReduction]: Total number of compositions: 120 [2023-11-19 04:59:04,714 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 28 transitions, 64 flow [2023-11-19 04:59:04,750 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 220 states, 211 states have (on average 2.7393364928909953) internal successors, (578), 219 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:04,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:59:04,775 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;@189f45ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:59:04,776 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-19 04:59:04,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 211 states have (on average 2.7393364928909953) internal successors, (578), 219 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-19 04:59:04,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:04,784 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-19 04:59:04,785 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:59:04,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:04,790 INFO L85 PathProgramCache]: Analyzing trace with hash 509, now seen corresponding path program 1 times [2023-11-19 04:59:04,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:59:04,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112137611] [2023-11-19 04:59:04,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:04,804 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 [2023-11-19 04:59:04,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:59:04,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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) [2023-11-19 04:59:04,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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 [2023-11-19 04:59:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:04,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 04:59:04,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:59:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:04,935 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:59:04,936 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:59:04,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112137611] [2023-11-19 04:59:04,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112137611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:59:04,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:59:04,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 04:59:04,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977625082] [2023-11-19 04:59:04,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:59:04,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 04:59:04,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:59:04,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 04:59:04,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:59:04,976 INFO L87 Difference]: Start difference. First operand has 220 states, 211 states have (on average 2.7393364928909953) internal successors, (578), 219 states have internal predecessors, (578), 0 states have call successors, (0), 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) [2023-11-19 04:59:05,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:59:05,091 INFO L93 Difference]: Finished difference Result 210 states and 506 transitions. [2023-11-19 04:59:05,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 04:59:05,093 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 [2023-11-19 04:59:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:59:05,111 INFO L225 Difference]: With dead ends: 210 [2023-11-19 04:59:05,112 INFO L226 Difference]: Without dead ends: 210 [2023-11-19 04:59:05,113 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 [2023-11-19 04:59:05,121 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:59:05,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:59:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-11-19 04:59:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2023-11-19 04:59:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 2.4682926829268292) internal successors, (506), 209 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 506 transitions. [2023-11-19 04:59:05,208 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 506 transitions. Word has length 1 [2023-11-19 04:59:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:59:05,209 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 506 transitions. [2023-11-19 04:59:05,209 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) [2023-11-19 04:59:05,210 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 506 transitions. [2023-11-19 04:59:05,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 04:59:05,212 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:05,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 04:59:05,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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 [2023-11-19 04:59:05,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:59:05,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:59:05,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:05,416 INFO L85 PathProgramCache]: Analyzing trace with hash 480359691, now seen corresponding path program 1 times [2023-11-19 04:59:05,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:59:05,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716440055] [2023-11-19 04:59:05,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:05,418 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 [2023-11-19 04:59:05,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:59:05,420 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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) [2023-11-19 04:59:05,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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 [2023-11-19 04:59:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:05,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 04:59:05,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:59:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:05,579 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:59:05,579 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:59:05,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716440055] [2023-11-19 04:59:05,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716440055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:59:05,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:59:05,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:59:05,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029458932] [2023-11-19 04:59:05,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:59:05,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:59:05,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:59:05,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:59:05,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:59:05,584 INFO L87 Difference]: Start difference. First operand 210 states and 506 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:05,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:59:05,663 INFO L93 Difference]: Finished difference Result 182 states and 433 transitions. [2023-11-19 04:59:05,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:59:05,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-11-19 04:59:05,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:59:05,669 INFO L225 Difference]: With dead ends: 182 [2023-11-19 04:59:05,670 INFO L226 Difference]: Without dead ends: 178 [2023-11-19 04:59:05,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:59:05,673 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:59:05,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 6 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:59:05,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-19 04:59:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2023-11-19 04:59:05,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 176 states have (on average 2.4204545454545454) internal successors, (426), 177 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:05,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 426 transitions. [2023-11-19 04:59:05,693 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 426 transitions. Word has length 5 [2023-11-19 04:59:05,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:59:05,694 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 426 transitions. [2023-11-19 04:59:05,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 426 transitions. [2023-11-19 04:59:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 04:59:05,695 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:05,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:59:05,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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 [2023-11-19 04:59:05,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:59:05,898 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:59:05,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:05,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2064223069, now seen corresponding path program 1 times [2023-11-19 04:59:05,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:59:05,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841876133] [2023-11-19 04:59:05,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:05,900 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 [2023-11-19 04:59:05,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:59:05,904 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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) [2023-11-19 04:59:05,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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 [2023-11-19 04:59:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:06,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 04:59:06,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:59:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:06,060 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:59:06,060 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:59:06,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841876133] [2023-11-19 04:59:06,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841876133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:59:06,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:59:06,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:59:06,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426194849] [2023-11-19 04:59:06,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:59:06,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:59:06,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:59:06,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:59:06,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:59:06,064 INFO L87 Difference]: Start difference. First operand 178 states and 426 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:06,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:59:06,186 INFO L93 Difference]: Finished difference Result 116 states and 219 transitions. [2023-11-19 04:59:06,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:59:06,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-19 04:59:06,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:59:06,188 INFO L225 Difference]: With dead ends: 116 [2023-11-19 04:59:06,188 INFO L226 Difference]: Without dead ends: 88 [2023-11-19 04:59:06,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:59:06,189 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 26 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:59:06,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 15 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:59:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-19 04:59:06,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-19 04:59:06,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.813953488372093) internal successors, (156), 87 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:06,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 156 transitions. [2023-11-19 04:59:06,196 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 156 transitions. Word has length 7 [2023-11-19 04:59:06,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:59:06,196 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 156 transitions. [2023-11-19 04:59:06,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 156 transitions. [2023-11-19 04:59:06,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:59:06,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:06,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:59:06,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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)] Ended with exit code 0 [2023-11-19 04:59:06,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:59:06,401 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:59:06,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:06,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1574798471, now seen corresponding path program 1 times [2023-11-19 04:59:06,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:59:06,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440283580] [2023-11-19 04:59:06,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:06,403 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 [2023-11-19 04:59:06,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:59:06,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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) [2023-11-19 04:59:06,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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 [2023-11-19 04:59:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:06,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 04:59:06,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:59:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:06,552 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:59:06,552 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:59:06,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440283580] [2023-11-19 04:59:06,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440283580] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:59:06,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:59:06,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:59:06,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469113402] [2023-11-19 04:59:06,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:59:06,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:59:06,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:59:06,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:59:06,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:59:06,555 INFO L87 Difference]: Start difference. First operand 88 states and 156 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:59:06,692 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2023-11-19 04:59:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:59:06,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-19 04:59:06,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:59:06,693 INFO L225 Difference]: With dead ends: 53 [2023-11-19 04:59:06,693 INFO L226 Difference]: Without dead ends: 43 [2023-11-19 04:59:06,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:59:06,695 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:59:06,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 24 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:59:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-19 04:59:06,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-19 04:59:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 42 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 66 transitions. [2023-11-19 04:59:06,698 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 66 transitions. Word has length 10 [2023-11-19 04:59:06,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:59:06,699 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 66 transitions. [2023-11-19 04:59:06,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2023-11-19 04:59:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 04:59:06,700 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:06,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:59:06,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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 [2023-11-19 04:59:06,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:59:06,900 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:59:06,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:06,901 INFO L85 PathProgramCache]: Analyzing trace with hash -714357366, now seen corresponding path program 1 times [2023-11-19 04:59:06,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:59:06,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172696634] [2023-11-19 04:59:06,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:06,902 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 [2023-11-19 04:59:06,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:59:06,903 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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) [2023-11-19 04:59:06,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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 [2023-11-19 04:59:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:07,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 04:59:07,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:59:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:07,056 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:59:07,056 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:59:07,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172696634] [2023-11-19 04:59:07,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172696634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:59:07,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:59:07,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:59:07,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292981897] [2023-11-19 04:59:07,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:59:07,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:59:07,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:59:07,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:59:07,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:59:07,062 INFO L87 Difference]: Start difference. First operand 43 states and 66 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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) [2023-11-19 04:59:07,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:59:07,169 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2023-11-19 04:59:07,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:59:07,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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 [2023-11-19 04:59:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:59:07,175 INFO L225 Difference]: With dead ends: 62 [2023-11-19 04:59:07,175 INFO L226 Difference]: Without dead ends: 62 [2023-11-19 04:59:07,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:59:07,176 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:59:07,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:59:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-19 04:59:07,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2023-11-19 04:59:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 59 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2023-11-19 04:59:07,183 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 16 [2023-11-19 04:59:07,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:59:07,183 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2023-11-19 04:59:07,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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) [2023-11-19 04:59:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2023-11-19 04:59:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 04:59:07,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:07,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:59:07,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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 [2023-11-19 04:59:07,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:59:07,389 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:59:07,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:07,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1488039672, now seen corresponding path program 2 times [2023-11-19 04:59:07,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:59:07,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110976233] [2023-11-19 04:59:07,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 04:59:07,390 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 [2023-11-19 04:59:07,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:59:07,391 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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) [2023-11-19 04:59:07,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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 [2023-11-19 04:59:07,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-19 04:59:07,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:59:07,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-19 04:59:07,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:59:07,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:07,685 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:59:07,685 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:59:07,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110976233] [2023-11-19 04:59:07,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110976233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:59:07,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:59:07,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:59:07,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443169169] [2023-11-19 04:59:07,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:59:07,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:59:07,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:59:07,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:59:07,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:59:07,688 INFO L87 Difference]: Start difference. First operand 60 states and 91 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:59:07,827 INFO L93 Difference]: Finished difference Result 74 states and 106 transitions. [2023-11-19 04:59:07,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:59:07,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-19 04:59:07,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:59:07,828 INFO L225 Difference]: With dead ends: 74 [2023-11-19 04:59:07,828 INFO L226 Difference]: Without dead ends: 74 [2023-11-19 04:59:07,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:59:07,829 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:59:07,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 9 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:59:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-19 04:59:07,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2023-11-19 04:59:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 57 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2023-11-19 04:59:07,834 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 88 transitions. Word has length 16 [2023-11-19 04:59:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:59:07,834 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 88 transitions. [2023-11-19 04:59:07,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 88 transitions. [2023-11-19 04:59:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 04:59:07,835 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:07,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:59:07,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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 [2023-11-19 04:59:08,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:59:08,039 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:59:08,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:08,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1050692816, now seen corresponding path program 3 times [2023-11-19 04:59:08,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:59:08,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119691465] [2023-11-19 04:59:08,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 04:59:08,040 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 [2023-11-19 04:59:08,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:59:08,042 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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) [2023-11-19 04:59:08,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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 [2023-11-19 04:59:08,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-19 04:59:08,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-19 04:59:08,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:59:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:59:08,287 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2023-11-19 04:59:08,287 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:59:08,288 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-19 04:59:08,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-19 04:59:08,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-19 04:59:08,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-19 04:59:08,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-19 04:59:08,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-19 04:59:08,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-19 04:59:08,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-19 04:59:08,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-19 04:59:08,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-19 04:59:08,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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 [2023-11-19 04:59:08,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:59:08,497 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-11-19 04:59:08,503 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 04:59:08,503 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 04:59:08,557 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 04:59:08,559 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 04:59:08,566 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 04:59:08,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:59:08 BasicIcfg [2023-11-19 04:59:08,575 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 04:59:08,576 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 04:59:08,576 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 04:59:08,576 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 04:59:08,577 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:58:57" (3/4) ... [2023-11-19 04:59:08,579 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 04:59:08,580 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 04:59:08,580 INFO L158 Benchmark]: Toolchain (without parser) took 12987.25ms. Allocated memory was 65.0MB in the beginning and 130.0MB in the end (delta: 65.0MB). Free memory was 39.6MB in the beginning and 97.3MB in the end (delta: -57.7MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2023-11-19 04:59:08,581 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 65.0MB. Free memory was 40.9MB in the beginning and 40.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:59:08,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 690.30ms. Allocated memory was 65.0MB in the beginning and 107.0MB in the end (delta: 41.9MB). Free memory was 39.4MB in the beginning and 71.8MB in the end (delta: -32.5MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2023-11-19 04:59:08,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.37ms. Allocated memory is still 107.0MB. Free memory was 71.8MB in the beginning and 69.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:59:08,582 INFO L158 Benchmark]: Boogie Preprocessor took 75.39ms. Allocated memory is still 107.0MB. Free memory was 69.4MB in the beginning and 67.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:59:08,583 INFO L158 Benchmark]: RCFGBuilder took 890.18ms. Allocated memory is still 107.0MB. Free memory was 67.4MB in the beginning and 58.4MB in the end (delta: 9.0MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2023-11-19 04:59:08,583 INFO L158 Benchmark]: TraceAbstraction took 11225.22ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 57.8MB in the beginning and 98.4MB in the end (delta: -40.5MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2023-11-19 04:59:08,583 INFO L158 Benchmark]: Witness Printer took 4.01ms. Allocated memory is still 130.0MB. Free memory was 98.4MB in the beginning and 97.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:59:08,586 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 65.0MB. Free memory was 40.9MB in the beginning and 40.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 690.30ms. Allocated memory was 65.0MB in the beginning and 107.0MB in the end (delta: 41.9MB). Free memory was 39.4MB in the beginning and 71.8MB in the end (delta: -32.5MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.37ms. Allocated memory is still 107.0MB. Free memory was 71.8MB in the beginning and 69.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.39ms. Allocated memory is still 107.0MB. Free memory was 69.4MB in the beginning and 67.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 890.18ms. Allocated memory is still 107.0MB. Free memory was 67.4MB in the beginning and 58.4MB in the end (delta: 9.0MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11225.22ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 57.8MB in the beginning and 98.4MB in the end (delta: -40.5MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. * Witness Printer took 4.01ms. Allocated memory is still 130.0MB. Free memory was 98.4MB in the beginning and 97.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2s, 113 PlacesBefore, 33 PlacesAfterwards, 111 TransitionsBefore, 28 TransitionsAfterwards, 1896 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 3 ChoiceCompositions, 120 TotalNumberOfCompositions, 3982 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2089, independent: 1954, independent conditional: 0, independent unconditional: 1954, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1378, independent: 1336, independent conditional: 0, independent unconditional: 1336, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1378, independent: 1291, independent conditional: 0, independent unconditional: 1291, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 405, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 312, dependent conditional: 0, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2089, independent: 618, independent conditional: 0, independent unconditional: 618, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 1378, unknown conditional: 0, unknown unconditional: 1378] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633={3:0}, t1634={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={3:0}, t1634={7:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 129 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 315 IncrementalHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 25 mSDtfsCounter, 315 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=0, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 209 SizeOfPredicates, 6 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 04:59:08,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f813ab1d-fc43-4f8f-b8c7-b6b3050f93c0/bin/utaipan-verify-t7M7D8N6sZ/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