./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E --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 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:30:32,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:30:32,428 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 04:30:32,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:30:32,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:30:32,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:30:32,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:30:32,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:30:32,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:30:32,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:30:32,485 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:30:32,485 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:30:32,486 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:30:32,486 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:30:32,487 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:30:32,487 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:30:32,487 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:30:32,487 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:30:32,487 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:30:32,487 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:30:32,487 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:30:32,487 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:30:32,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 04:30:32,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 04:30:32,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:30:32,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:30:32,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:30:32,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:30:32,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:30:32,489 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 04:30:32,490 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 04:30:32,490 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 04:30:32,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:30:32,490 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:30:32,490 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:30:32,490 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 04:30:32,490 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:30:32,490 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:30:32,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:30:32,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:30:32,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:30:32,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:30:32,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:30:32,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:30:32,491 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:30:32,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:30:32,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:30:32,491 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:30:32,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:30:32,492 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E 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 -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 [2024-11-14 04:30:32,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:30:32,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:30:32,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:30:32,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:30:32,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:30:32,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i Unable to find full path for "g++" [2024-11-14 04:30:35,149 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:30:35,586 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:30:35,587 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-11-14 04:30:35,607 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/data/e898b2194/2603febacbd44f4fa49791ec892282d5/FLAG2cddc2286 [2024-11-14 04:30:35,625 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/data/e898b2194/2603febacbd44f4fa49791ec892282d5 [2024-11-14 04:30:35,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:30:35,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:30:35,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:30:35,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:30:35,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:30:35,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:30:35" (1/1) ... [2024-11-14 04:30:35,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6d12c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:35, skipping insertion in model container [2024-11-14 04:30:35,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:30:35" (1/1) ... [2024-11-14 04:30:35,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:30:36,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:30:36,147 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:30:36,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:30:36,299 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:30:36,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:36 WrapperNode [2024-11-14 04:30:36,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:30:36,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:30:36,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:30:36,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:30:36,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:36" (1/1) ... [2024-11-14 04:30:36,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:36" (1/1) ... [2024-11-14 04:30:36,355 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125 [2024-11-14 04:30:36,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:30:36,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:30:36,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:30:36,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:30:36,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:36" (1/1) ... [2024-11-14 04:30:36,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:36" (1/1) ... [2024-11-14 04:30:36,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:36" (1/1) ... [2024-11-14 04:30:36,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:36" (1/1) ... [2024-11-14 04:30:36,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:36" (1/1) ... [2024-11-14 04:30:36,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:36" (1/1) ... [2024-11-14 04:30:36,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:36" (1/1) ... [2024-11-14 04:30:36,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:36" (1/1) ... [2024-11-14 04:30:36,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:30:36,389 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:30:36,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:30:36,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:30:36,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:36" (1/1) ... [2024-11-14 04:30:36,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:30:36,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:30:36,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:30:36,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:30:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 04:30:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:30:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-14 04:30:36,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-14 04:30:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-14 04:30:36,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-14 04:30:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:30:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 04:30:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:30:36,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:30:36,473 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 04:30:36,689 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:30:36,691 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:30:37,110 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 04:30:37,110 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:30:37,419 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:30:37,419 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 04:30:37,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:30:37 BoogieIcfgContainer [2024-11-14 04:30:37,421 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:30:37,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:30:37,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:30:37,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:30:37,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:30:35" (1/3) ... [2024-11-14 04:30:37,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0de3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:30:37, skipping insertion in model container [2024-11-14 04:30:37,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:36" (2/3) ... [2024-11-14 04:30:37,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0de3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:30:37, skipping insertion in model container [2024-11-14 04:30:37,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:30:37" (3/3) ... [2024-11-14 04:30:37,436 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-11-14 04:30:37,460 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:30:37,462 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i that has 3 procedures, 34 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-14 04:30:37,463 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 04:30:37,541 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-14 04:30:37,588 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 35 transitions, 78 flow [2024-11-14 04:30:37,749 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 823 states, 818 states have (on average 2.790953545232274) internal successors, (2283), 822 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:37,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:30:37,808 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@37bc83ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:30:37,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-14 04:30:37,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 823 states, 818 states have (on average 2.790953545232274) internal successors, (2283), 822 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:37,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 04:30:37,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:37,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 04:30:37,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:30:37,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash 10512786, now seen corresponding path program 1 times [2024-11-14 04:30:37,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:37,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106245317] [2024-11-14 04:30:37,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:37,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:38,604 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:38,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106245317] [2024-11-14 04:30:38,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106245317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:38,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 04:30:38,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254734937] [2024-11-14 04:30:38,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:38,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:30:38,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:38,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:30:38,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:30:38,645 INFO L87 Difference]: Start difference. First operand has 823 states, 818 states have (on average 2.790953545232274) internal successors, (2283), 822 states have internal predecessors, (2283), 0 states have call successors, (0), 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 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:38,844 INFO L93 Difference]: Finished difference Result 984 states and 2694 transitions. [2024-11-14 04:30:38,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:30:38,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-14 04:30:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:38,866 INFO L225 Difference]: With dead ends: 984 [2024-11-14 04:30:38,866 INFO L226 Difference]: Without dead ends: 653 [2024-11-14 04:30:38,871 INFO L431 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 [2024-11-14 04:30:38,875 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:38,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 23 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:30:38,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-14 04:30:38,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2024-11-14 04:30:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 651 states have (on average 2.6236559139784945) internal successors, (1708), 652 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1708 transitions. [2024-11-14 04:30:39,012 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1708 transitions. Word has length 4 [2024-11-14 04:30:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:39,013 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 1708 transitions. [2024-11-14 04:30:39,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1708 transitions. [2024-11-14 04:30:39,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 04:30:39,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:39,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:39,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:30:39,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:30:39,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1003970263, now seen corresponding path program 1 times [2024-11-14 04:30:39,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:39,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971996328] [2024-11-14 04:30:39,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:39,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:39,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:39,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971996328] [2024-11-14 04:30:39,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971996328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:39,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:39,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 04:30:39,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075481299] [2024-11-14 04:30:39,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:39,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:30:39,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:39,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:30:39,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:30:39,265 INFO L87 Difference]: Start difference. First operand 653 states and 1708 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:39,336 INFO L93 Difference]: Finished difference Result 653 states and 1708 transitions. [2024-11-14 04:30:39,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:30:39,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-14 04:30:39,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:39,343 INFO L225 Difference]: With dead ends: 653 [2024-11-14 04:30:39,343 INFO L226 Difference]: Without dead ends: 506 [2024-11-14 04:30:39,344 INFO L431 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 [2024-11-14 04:30:39,348 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:39,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 11 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:30:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-14 04:30:39,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2024-11-14 04:30:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 2.592079207920792) internal successors, (1309), 505 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1309 transitions. [2024-11-14 04:30:39,414 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1309 transitions. Word has length 13 [2024-11-14 04:30:39,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:39,415 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 1309 transitions. [2024-11-14 04:30:39,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1309 transitions. [2024-11-14 04:30:39,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 04:30:39,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:39,420 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:39,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 04:30:39,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:30:39,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:39,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1003968983, now seen corresponding path program 1 times [2024-11-14 04:30:39,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:39,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527744691] [2024-11-14 04:30:39,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:39,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:41,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:41,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527744691] [2024-11-14 04:30:41,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527744691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:41,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:41,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:30:41,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889115278] [2024-11-14 04:30:41,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:41,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:30:41,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:41,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:30:41,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:30:41,265 INFO L87 Difference]: Start difference. First operand 506 states and 1309 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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) [2024-11-14 04:30:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:42,139 INFO L93 Difference]: Finished difference Result 783 states and 2010 transitions. [2024-11-14 04:30:42,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 04:30:42,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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 [2024-11-14 04:30:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:42,152 INFO L225 Difference]: With dead ends: 783 [2024-11-14 04:30:42,152 INFO L226 Difference]: Without dead ends: 528 [2024-11-14 04:30:42,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:30:42,159 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 66 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:42,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 96 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:30:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-14 04:30:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 483. [2024-11-14 04:30:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 2.5560165975103732) internal successors, (1232), 482 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1232 transitions. [2024-11-14 04:30:42,212 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 1232 transitions. Word has length 13 [2024-11-14 04:30:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:42,212 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 1232 transitions. [2024-11-14 04:30:42,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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) [2024-11-14 04:30:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 1232 transitions. [2024-11-14 04:30:42,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 04:30:42,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:42,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:42,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 04:30:42,221 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:30:42,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1698574728, now seen corresponding path program 1 times [2024-11-14 04:30:42,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:42,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299422911] [2024-11-14 04:30:42,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:42,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:43,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:43,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299422911] [2024-11-14 04:30:43,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299422911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:43,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:43,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:30:43,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267344339] [2024-11-14 04:30:43,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:43,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:30:43,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:30:43,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:30:43,375 INFO L87 Difference]: Start difference. First operand 483 states and 1232 transitions. Second operand has 6 states, 6 states have (on average 2.5) 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) [2024-11-14 04:30:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:43,771 INFO L93 Difference]: Finished difference Result 608 states and 1532 transitions. [2024-11-14 04:30:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:30:43,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) 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 [2024-11-14 04:30:43,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:43,776 INFO L225 Difference]: With dead ends: 608 [2024-11-14 04:30:43,777 INFO L226 Difference]: Without dead ends: 433 [2024-11-14 04:30:43,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 04:30:43,779 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:43,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 59 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:30:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-14 04:30:43,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2024-11-14 04:30:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 2.5277777777777777) internal successors, (1092), 432 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1092 transitions. [2024-11-14 04:30:43,806 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1092 transitions. Word has length 15 [2024-11-14 04:30:43,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:43,806 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 1092 transitions. [2024-11-14 04:30:43,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) 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) [2024-11-14 04:30:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1092 transitions. [2024-11-14 04:30:43,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 04:30:43,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:43,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:43,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 04:30:43,809 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:30:43,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:43,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2069243363, now seen corresponding path program 1 times [2024-11-14 04:30:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:43,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609691677] [2024-11-14 04:30:43,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:43,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:44,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:44,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609691677] [2024-11-14 04:30:44,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609691677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:44,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:44,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:30:44,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305483543] [2024-11-14 04:30:44,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:44,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:30:44,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:44,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:30:44,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:30:44,251 INFO L87 Difference]: Start difference. First operand 433 states and 1092 transitions. Second operand has 5 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) [2024-11-14 04:30:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:44,599 INFO L93 Difference]: Finished difference Result 773 states and 1919 transitions. [2024-11-14 04:30:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:30:44,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 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 [2024-11-14 04:30:44,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:44,605 INFO L225 Difference]: With dead ends: 773 [2024-11-14 04:30:44,605 INFO L226 Difference]: Without dead ends: 488 [2024-11-14 04:30:44,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:30:44,607 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 53 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:44,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 80 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:30:44,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-14 04:30:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 386. [2024-11-14 04:30:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 2.451948051948052) internal successors, (944), 385 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 944 transitions. [2024-11-14 04:30:44,639 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 944 transitions. Word has length 16 [2024-11-14 04:30:44,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:44,639 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 944 transitions. [2024-11-14 04:30:44,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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) [2024-11-14 04:30:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 944 transitions. [2024-11-14 04:30:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 04:30:44,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:44,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:44,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 04:30:44,641 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:30:44,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:44,642 INFO L85 PathProgramCache]: Analyzing trace with hash -840892796, now seen corresponding path program 1 times [2024-11-14 04:30:44,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:44,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117971999] [2024-11-14 04:30:44,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:44,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:45,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:45,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:45,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117971999] [2024-11-14 04:30:45,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117971999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:45,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:45,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:30:45,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292408891] [2024-11-14 04:30:45,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:45,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:30:45,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:45,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:30:45,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:30:45,871 INFO L87 Difference]: Start difference. First operand 386 states and 944 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) 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) [2024-11-14 04:30:46,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:46,338 INFO L93 Difference]: Finished difference Result 491 states and 1188 transitions. [2024-11-14 04:30:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:30:46,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) 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 [2024-11-14 04:30:46,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:46,344 INFO L225 Difference]: With dead ends: 491 [2024-11-14 04:30:46,346 INFO L226 Difference]: Without dead ends: 366 [2024-11-14 04:30:46,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:30:46,349 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:46,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 72 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:30:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-14 04:30:46,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-11-14 04:30:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.421917808219178) internal successors, (884), 365 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 884 transitions. [2024-11-14 04:30:46,388 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 884 transitions. Word has length 17 [2024-11-14 04:30:46,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:46,389 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 884 transitions. [2024-11-14 04:30:46,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) 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) [2024-11-14 04:30:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 884 transitions. [2024-11-14 04:30:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 04:30:46,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:46,391 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:46,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 04:30:46,392 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:30:46,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:46,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1725960891, now seen corresponding path program 1 times [2024-11-14 04:30:46,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:46,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445050653] [2024-11-14 04:30:46,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:46,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:47,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:47,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445050653] [2024-11-14 04:30:47,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445050653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:47,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:47,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 04:30:47,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173767157] [2024-11-14 04:30:47,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:47,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 04:30:47,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:47,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 04:30:47,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 04:30:47,922 INFO L87 Difference]: Start difference. First operand 366 states and 884 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:48,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:48,506 INFO L93 Difference]: Finished difference Result 456 states and 1079 transitions. [2024-11-14 04:30:48,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:30:48,507 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 04:30:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:48,512 INFO L225 Difference]: With dead ends: 456 [2024-11-14 04:30:48,512 INFO L226 Difference]: Without dead ends: 336 [2024-11-14 04:30:48,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:30:48,514 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 57 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:48,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 105 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 04:30:48,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-14 04:30:48,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2024-11-14 04:30:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.388059701492537) internal successors, (800), 335 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:48,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 800 transitions. [2024-11-14 04:30:48,536 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 800 transitions. Word has length 19 [2024-11-14 04:30:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:48,536 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 800 transitions. [2024-11-14 04:30:48,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 800 transitions. [2024-11-14 04:30:48,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 04:30:48,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:48,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:48,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 04:30:48,539 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:30:48,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash 843729305, now seen corresponding path program 2 times [2024-11-14 04:30:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:48,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054719729] [2024-11-14 04:30:48,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:48,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:49,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:49,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054719729] [2024-11-14 04:30:49,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054719729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:49,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:49,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 04:30:49,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930340081] [2024-11-14 04:30:49,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:49,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 04:30:49,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:49,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 04:30:49,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-14 04:30:49,845 INFO L87 Difference]: Start difference. First operand 336 states and 800 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:50,439 INFO L93 Difference]: Finished difference Result 431 states and 1004 transitions. [2024-11-14 04:30:50,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 04:30:50,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 04:30:50,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:50,444 INFO L225 Difference]: With dead ends: 431 [2024-11-14 04:30:50,444 INFO L226 Difference]: Without dead ends: 338 [2024-11-14 04:30:50,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:30:50,446 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 49 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:50,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 120 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 04:30:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-14 04:30:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2024-11-14 04:30:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 2.3679525222551927) internal successors, (798), 337 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 798 transitions. [2024-11-14 04:30:50,466 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 798 transitions. Word has length 19 [2024-11-14 04:30:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:50,467 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 798 transitions. [2024-11-14 04:30:50,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 798 transitions. [2024-11-14 04:30:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 04:30:50,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:50,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:50,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 04:30:50,472 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:30:50,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:50,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1814360787, now seen corresponding path program 3 times [2024-11-14 04:30:50,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:50,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585434161] [2024-11-14 04:30:50,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:50,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:51,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:51,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585434161] [2024-11-14 04:30:51,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585434161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:51,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:51,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 04:30:51,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555338086] [2024-11-14 04:30:51,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:51,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 04:30:51,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:51,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 04:30:51,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 04:30:51,613 INFO L87 Difference]: Start difference. First operand 338 states and 798 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:52,167 INFO L93 Difference]: Finished difference Result 417 states and 974 transitions. [2024-11-14 04:30:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 04:30:52,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 04:30:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:52,172 INFO L225 Difference]: With dead ends: 417 [2024-11-14 04:30:52,172 INFO L226 Difference]: Without dead ends: 326 [2024-11-14 04:30:52,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:30:52,175 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 55 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:52,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 110 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 04:30:52,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-14 04:30:52,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-11-14 04:30:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 2.375384615384615) internal successors, (772), 325 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:52,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 772 transitions. [2024-11-14 04:30:52,195 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 772 transitions. Word has length 19 [2024-11-14 04:30:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:52,198 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 772 transitions. [2024-11-14 04:30:52,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:52,198 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 772 transitions. [2024-11-14 04:30:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 04:30:52,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:52,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:52,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 04:30:52,201 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:30:52,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:52,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1858674205, now seen corresponding path program 4 times [2024-11-14 04:30:52,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:52,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109506815] [2024-11-14 04:30:52,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:52,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:53,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:53,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109506815] [2024-11-14 04:30:53,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109506815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:53,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:53,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 04:30:53,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630472407] [2024-11-14 04:30:53,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:53,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 04:30:53,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:53,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 04:30:53,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-14 04:30:53,083 INFO L87 Difference]: Start difference. First operand 326 states and 772 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:53,622 INFO L93 Difference]: Finished difference Result 524 states and 1225 transitions. [2024-11-14 04:30:53,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:30:53,623 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 04:30:53,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:53,627 INFO L225 Difference]: With dead ends: 524 [2024-11-14 04:30:53,627 INFO L226 Difference]: Without dead ends: 321 [2024-11-14 04:30:53,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:30:53,629 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:53,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 96 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:30:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-14 04:30:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 261. [2024-11-14 04:30:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 2.3230769230769233) internal successors, (604), 260 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 604 transitions. [2024-11-14 04:30:53,645 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 604 transitions. Word has length 19 [2024-11-14 04:30:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:53,645 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 604 transitions. [2024-11-14 04:30:53,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 604 transitions. [2024-11-14 04:30:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 04:30:53,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:53,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:53,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 04:30:53,648 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:30:53,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1341521189, now seen corresponding path program 1 times [2024-11-14 04:30:53,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:53,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264324999] [2024-11-14 04:30:53,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:53,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:53,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:53,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264324999] [2024-11-14 04:30:53,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264324999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:53,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:53,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:30:53,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548969741] [2024-11-14 04:30:53,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:53,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:30:53,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:53,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:30:53,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:30:53,837 INFO L87 Difference]: Start difference. First operand 261 states and 604 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:53,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:53,959 INFO L93 Difference]: Finished difference Result 375 states and 849 transitions. [2024-11-14 04:30:53,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:30:53,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 04:30:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:53,963 INFO L225 Difference]: With dead ends: 375 [2024-11-14 04:30:53,963 INFO L226 Difference]: Without dead ends: 198 [2024-11-14 04:30:53,965 INFO L431 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 [2024-11-14 04:30:53,965 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:53,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 19 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:30:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-14 04:30:53,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-14 04:30:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.16751269035533) internal successors, (427), 197 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 427 transitions. [2024-11-14 04:30:53,979 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 427 transitions. Word has length 19 [2024-11-14 04:30:53,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:53,979 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 427 transitions. [2024-11-14 04:30:53,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:53,980 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 427 transitions. [2024-11-14 04:30:53,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 04:30:53,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:53,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:53,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 04:30:53,983 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:30:53,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:53,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1578318761, now seen corresponding path program 1 times [2024-11-14 04:30:53,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:53,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292646375] [2024-11-14 04:30:53,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:53,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:54,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:54,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292646375] [2024-11-14 04:30:54,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292646375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:54,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:54,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:30:54,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676596085] [2024-11-14 04:30:54,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:54,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:30:54,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:54,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:30:54,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:30:54,247 INFO L87 Difference]: Start difference. First operand 198 states and 427 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:54,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:54,389 INFO L93 Difference]: Finished difference Result 230 states and 487 transitions. [2024-11-14 04:30:54,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:30:54,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-14 04:30:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:54,392 INFO L225 Difference]: With dead ends: 230 [2024-11-14 04:30:54,392 INFO L226 Difference]: Without dead ends: 92 [2024-11-14 04:30:54,393 INFO L431 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 [2024-11-14 04:30:54,397 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:54,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 13 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:30:54,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-14 04:30:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-14 04:30:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.945054945054945) internal successors, (177), 91 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 177 transitions. [2024-11-14 04:30:54,407 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 177 transitions. Word has length 20 [2024-11-14 04:30:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:54,408 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 177 transitions. [2024-11-14 04:30:54,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 177 transitions. [2024-11-14 04:30:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 04:30:54,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:54,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:54,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 04:30:54,410 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:30:54,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:54,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1948799162, now seen corresponding path program 1 times [2024-11-14 04:30:54,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:54,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687688425] [2024-11-14 04:30:54,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:54,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:30:54,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:30:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:30:54,638 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:30:54,639 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:30:54,640 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-14 04:30:54,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-14 04:30:54,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-14 04:30:54,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-14 04:30:54,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-14 04:30:54,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-14 04:30:54,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 04:30:54,651 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:54,763 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 04:30:54,765 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:30:54,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:30:54 BasicIcfg [2024-11-14 04:30:54,772 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:30:54,773 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:30:54,773 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:30:54,773 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:30:54,774 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:30:37" (3/4) ... [2024-11-14 04:30:54,777 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 04:30:54,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:30:54,779 INFO L158 Benchmark]: Toolchain (without parser) took 19149.54ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 93.5MB in the beginning and 311.6MB in the end (delta: -218.2MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2024-11-14 04:30:54,780 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 142.6MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:30:54,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 669.08ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 70.7MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 04:30:54,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.46ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 68.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:30:54,781 INFO L158 Benchmark]: Boogie Preprocessor took 32.02ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 66.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:30:54,781 INFO L158 Benchmark]: RCFGBuilder took 1031.92ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 74.9MB in the end (delta: -8.0MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-14 04:30:54,782 INFO L158 Benchmark]: TraceAbstraction took 17346.30ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 74.3MB in the beginning and 311.7MB in the end (delta: -237.4MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2024-11-14 04:30:54,782 INFO L158 Benchmark]: Witness Printer took 5.75ms. Allocated memory is still 427.8MB. Free memory was 311.7MB in the beginning and 311.6MB in the end (delta: 56.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:30:54,785 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.51ms. Allocated memory is still 142.6MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 669.08ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 70.7MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.46ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 68.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.02ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 66.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1031.92ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 74.9MB in the end (delta: -8.0MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17346.30ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 74.3MB in the beginning and 311.7MB in the end (delta: -237.4MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * Witness Printer took 5.75ms. Allocated memory is still 427.8MB. Free memory was 311.7MB in the beginning and 311.6MB in the end (delta: 56.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L745] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "safe029_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 788]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: 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, 51 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 17.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 526 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 526 mSDsluCounter, 804 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 595 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1228 IncrementalHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 209 mSDtfsCounter, 1228 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=823occurred in iteration=0, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 207 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 [2024-11-14 04:30:54,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E --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 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:30:58,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:30:58,599 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 04:30:58,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:30:58,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:30:58,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:30:58,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:30:58,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:30:58,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:30:58,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:30:58,662 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:30:58,662 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:30:58,666 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:30:58,666 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:30:58,666 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:30:58,667 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:30:58,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 04:30:58,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 04:30:58,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:30:58,668 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:30:58,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:30:58,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:30:58,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:30:58,668 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 04:30:58,668 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 04:30:58,668 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 04:30:58,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:30:58,669 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:30:58,669 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 04:30:58,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:30:58,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 04:30:58,669 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 04:30:58,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:30:58,669 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:30:58,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:30:58,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 04:30:58,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:30:58,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:30:58,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:30:58,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:30:58,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:30:58,674 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 04:30:58,674 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 04:30:58,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:30:58,675 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:30:58,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E 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 -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 [2024-11-14 04:30:59,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:30:59,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:30:59,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:30:59,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:30:59,129 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:30:59,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i Unable to find full path for "g++" [2024-11-14 04:31:01,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:31:02,139 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:31:02,140 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-11-14 04:31:02,171 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/data/8fc164a09/cb1937148da345339c04467918592107/FLAG02f61ea83 [2024-11-14 04:31:02,204 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/data/8fc164a09/cb1937148da345339c04467918592107 [2024-11-14 04:31:02,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:31:02,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:31:02,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:31:02,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:31:02,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:31:02,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:31:02" (1/1) ... [2024-11-14 04:31:02,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4311c2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:02, skipping insertion in model container [2024-11-14 04:31:02,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:31:02" (1/1) ... [2024-11-14 04:31:02,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:31:02,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:31:02,820 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:31:02,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:31:02,962 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:31:02,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:02 WrapperNode [2024-11-14 04:31:02,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:31:02,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:31:02,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:31:02,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:31:02,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:02" (1/1) ... [2024-11-14 04:31:02,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:02" (1/1) ... [2024-11-14 04:31:03,029 INFO L138 Inliner]: procedures = 175, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126 [2024-11-14 04:31:03,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:31:03,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:31:03,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:31:03,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:31:03,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:02" (1/1) ... [2024-11-14 04:31:03,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:02" (1/1) ... [2024-11-14 04:31:03,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:02" (1/1) ... [2024-11-14 04:31:03,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:02" (1/1) ... [2024-11-14 04:31:03,058 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:02" (1/1) ... [2024-11-14 04:31:03,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:02" (1/1) ... [2024-11-14 04:31:03,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:02" (1/1) ... [2024-11-14 04:31:03,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:02" (1/1) ... [2024-11-14 04:31:03,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:31:03,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:31:03,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:31:03,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:31:03,073 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:02" (1/1) ... [2024-11-14 04:31:03,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:31:03,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:31:03,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:31:03,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:31:03,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 04:31:03,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:31:03,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 04:31:03,155 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-14 04:31:03,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-14 04:31:03,155 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-14 04:31:03,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-14 04:31:03,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 04:31:03,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:31:03,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:31:03,157 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 04:31:03,373 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:31:03,376 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:31:03,848 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 04:31:03,848 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:31:04,194 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:31:04,195 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 04:31:04,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:31:04 BoogieIcfgContainer [2024-11-14 04:31:04,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:31:04,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:31:04,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:31:04,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:31:04,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:31:02" (1/3) ... [2024-11-14 04:31:04,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d2241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:31:04, skipping insertion in model container [2024-11-14 04:31:04,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:31:02" (2/3) ... [2024-11-14 04:31:04,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d2241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:31:04, skipping insertion in model container [2024-11-14 04:31:04,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:31:04" (3/3) ... [2024-11-14 04:31:04,215 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-11-14 04:31:04,234 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:31:04,236 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i that has 3 procedures, 34 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-14 04:31:04,236 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 04:31:04,328 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-14 04:31:04,373 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 35 transitions, 78 flow [2024-11-14 04:31:04,573 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 823 states, 818 states have (on average 2.790953545232274) internal successors, (2283), 822 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:31:04,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:31:04,649 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@1e40eab1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:31:04,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-14 04:31:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 823 states, 818 states have (on average 2.790953545232274) internal successors, (2283), 822 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:31:04,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 04:31:04,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:31:04,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 04:31:04,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:31:04,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:31:04,674 INFO L85 PathProgramCache]: Analyzing trace with hash 10576276, now seen corresponding path program 1 times [2024-11-14 04:31:04,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:31:04,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532526837] [2024-11-14 04:31:04,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:31:04,695 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 [2024-11-14 04:31:04,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:31:04,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 04:31:04,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 04:31:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:31:04,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 04:31:04,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:31:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:31:04,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:31:04,936 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:31:04,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532526837] [2024-11-14 04:31:04,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532526837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:31:04,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:31:04,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 04:31:04,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082903293] [2024-11-14 04:31:04,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:31:04,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:31:04,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:31:04,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:31:04,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:31:04,993 INFO L87 Difference]: Start difference. First operand has 823 states, 818 states have (on average 2.790953545232274) internal successors, (2283), 822 states have internal predecessors, (2283), 0 states have call successors, (0), 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 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:31:05,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:31:05,214 INFO L93 Difference]: Finished difference Result 984 states and 2694 transitions. [2024-11-14 04:31:05,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:31:05,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-14 04:31:05,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:31:05,249 INFO L225 Difference]: With dead ends: 984 [2024-11-14 04:31:05,249 INFO L226 Difference]: Without dead ends: 653 [2024-11-14 04:31:05,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:31:05,259 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:31:05,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 23 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:31:05,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-14 04:31:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2024-11-14 04:31:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 651 states have (on average 2.6236559139784945) internal successors, (1708), 652 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:31:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1708 transitions. [2024-11-14 04:31:05,432 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1708 transitions. Word has length 4 [2024-11-14 04:31:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:31:05,432 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 1708 transitions. [2024-11-14 04:31:05,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:31:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1708 transitions. [2024-11-14 04:31:05,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 04:31:05,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:31:05,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:31:05,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Ended with exit code 0 [2024-11-14 04:31:05,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:31:05,640 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:31:05,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:31:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1331505195, now seen corresponding path program 1 times [2024-11-14 04:31:05,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:31:05,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250180469] [2024-11-14 04:31:05,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:31:05,642 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 [2024-11-14 04:31:05,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:31:05,646 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 04:31:05,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 04:31:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:31:05,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:31:05,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:31:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:31:05,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:31:05,878 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:31:05,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250180469] [2024-11-14 04:31:05,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250180469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:31:05,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:31:05,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:31:05,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219532437] [2024-11-14 04:31:05,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:31:05,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:31:05,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:31:05,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:31:05,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:31:05,885 INFO L87 Difference]: Start difference. First operand 653 states and 1708 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) [2024-11-14 04:31:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:31:06,077 INFO L93 Difference]: Finished difference Result 917 states and 2322 transitions. [2024-11-14 04:31:06,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:31:06,078 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 [2024-11-14 04:31:06,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:31:06,085 INFO L225 Difference]: With dead ends: 917 [2024-11-14 04:31:06,085 INFO L226 Difference]: Without dead ends: 378 [2024-11-14 04:31:06,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:31:06,089 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:31:06,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 29 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:31:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-14 04:31:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2024-11-14 04:31:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 376 states have (on average 2.348404255319149) internal successors, (883), 377 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:31:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 883 transitions. [2024-11-14 04:31:06,165 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 883 transitions. Word has length 13 [2024-11-14 04:31:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:31:06,166 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 883 transitions. [2024-11-14 04:31:06,166 INFO L472 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) [2024-11-14 04:31:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 883 transitions. [2024-11-14 04:31:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 04:31:06,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:31:06,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:31:06,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Ended with exit code 0 [2024-11-14 04:31:06,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:31:06,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:31:06,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:31:06,373 INFO L85 PathProgramCache]: Analyzing trace with hash -558774983, now seen corresponding path program 1 times [2024-11-14 04:31:06,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:31:06,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542309218] [2024-11-14 04:31:06,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:31:06,375 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 [2024-11-14 04:31:06,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:31:06,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 04:31:06,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 04:31:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:31:06,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:31:06,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:31:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:31:06,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:31:06,604 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:31:06,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542309218] [2024-11-14 04:31:06,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542309218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:31:06,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:31:06,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:31:06,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705427829] [2024-11-14 04:31:06,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:31:06,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:31:06,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:31:06,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:31:06,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:31:06,607 INFO L87 Difference]: Start difference. First operand 378 states and 883 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:31:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:31:06,836 INFO L93 Difference]: Finished difference Result 422 states and 967 transitions. [2024-11-14 04:31:06,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:31:06,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-14 04:31:06,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:31:06,843 INFO L225 Difference]: With dead ends: 422 [2024-11-14 04:31:06,845 INFO L226 Difference]: Without dead ends: 158 [2024-11-14 04:31:06,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:31:06,847 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 50 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:31:06,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 36 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:31:06,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-14 04:31:06,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-14 04:31:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 156 states have (on average 2.1346153846153846) internal successors, (333), 157 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:31:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 333 transitions. [2024-11-14 04:31:06,861 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 333 transitions. Word has length 18 [2024-11-14 04:31:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:31:06,861 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 333 transitions. [2024-11-14 04:31:06,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:31:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 333 transitions. [2024-11-14 04:31:06,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 04:31:06,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:31:06,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:31:06,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 04:31:07,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:31:07,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:31:07,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:31:07,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1346918940, now seen corresponding path program 1 times [2024-11-14 04:31:07,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:31:07,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494380698] [2024-11-14 04:31:07,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:31:07,069 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 [2024-11-14 04:31:07,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:31:07,077 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 04:31:07,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 04:31:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:31:07,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 04:31:07,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:31:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:31:07,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:31:07,341 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:31:07,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494380698] [2024-11-14 04:31:07,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494380698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:31:07,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:31:07,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 04:31:07,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743364648] [2024-11-14 04:31:07,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:31:07,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:31:07,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:31:07,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:31:07,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:31:07,343 INFO L87 Difference]: Start difference. First operand 158 states and 333 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:31:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:31:07,402 INFO L93 Difference]: Finished difference Result 158 states and 333 transitions. [2024-11-14 04:31:07,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:31:07,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-14 04:31:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:31:07,408 INFO L225 Difference]: With dead ends: 158 [2024-11-14 04:31:07,408 INFO L226 Difference]: Without dead ends: 146 [2024-11-14 04:31:07,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:31:07,411 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:31:07,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 11 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:31:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-14 04:31:07,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-14 04:31:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.1310344827586207) internal successors, (309), 145 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:31:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 309 transitions. [2024-11-14 04:31:07,430 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 309 transitions. Word has length 23 [2024-11-14 04:31:07,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:31:07,430 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 309 transitions. [2024-11-14 04:31:07,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:31:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 309 transitions. [2024-11-14 04:31:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 04:31:07,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:31:07,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:31:07,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Ended with exit code 0 [2024-11-14 04:31:07,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:31:07,634 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:31:07,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:31:07,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1346920220, now seen corresponding path program 1 times [2024-11-14 04:31:07,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:31:07,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082928098] [2024-11-14 04:31:07,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:31:07,637 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 [2024-11-14 04:31:07,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:31:07,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 04:31:07,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 04:31:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:31:07,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 04:31:07,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:31:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:31:07,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:31:07,917 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:31:07,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082928098] [2024-11-14 04:31:07,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082928098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:31:07,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:31:07,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:31:07,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929674963] [2024-11-14 04:31:07,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:31:07,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:31:07,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:31:07,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:31:07,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:31:07,921 INFO L87 Difference]: Start difference. First operand 146 states and 309 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:31:08,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:31:08,122 INFO L93 Difference]: Finished difference Result 218 states and 455 transitions. [2024-11-14 04:31:08,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:31:08,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-14 04:31:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:31:08,126 INFO L225 Difference]: With dead ends: 218 [2024-11-14 04:31:08,126 INFO L226 Difference]: Without dead ends: 116 [2024-11-14 04:31:08,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:31:08,128 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:31:08,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 50 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:31:08,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-14 04:31:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-14 04:31:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.034782608695652) internal successors, (234), 115 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:31:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 234 transitions. [2024-11-14 04:31:08,137 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 234 transitions. Word has length 23 [2024-11-14 04:31:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:31:08,138 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 234 transitions. [2024-11-14 04:31:08,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:31:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 234 transitions. [2024-11-14 04:31:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 04:31:08,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:31:08,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:31:08,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Ended with exit code 0 [2024-11-14 04:31:08,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:31:08,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-14 04:31:08,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:31:08,345 INFO L85 PathProgramCache]: Analyzing trace with hash -46877156, now seen corresponding path program 2 times [2024-11-14 04:31:08,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:31:08,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430832904] [2024-11-14 04:31:08,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:31:08,346 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 [2024-11-14 04:31:08,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:31:08,351 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-14 04:31:08,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 04:31:08,555 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-14 04:31:08,556 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-14 04:31:08,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:31:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:31:08,733 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2024-11-14 04:31:08,734 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:31:08,739 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-14 04:31:08,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-14 04:31:08,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-14 04:31:08,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-14 04:31:08,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-14 04:31:08,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-14 04:31:08,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Ended with exit code 0 [2024-11-14 04:31:08,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:31:08,949 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-11-14 04:31:09,076 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 04:31:09,078 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:31:09,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:31:09 BasicIcfg [2024-11-14 04:31:09,085 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:31:09,086 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:31:09,086 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:31:09,087 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:31:09,088 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:31:04" (3/4) ... [2024-11-14 04:31:09,092 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 04:31:09,093 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:31:09,096 INFO L158 Benchmark]: Toolchain (without parser) took 6883.65ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 91.0MB in the beginning and 153.9MB in the end (delta: -62.9MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. [2024-11-14 04:31:09,097 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 117.4MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:31:09,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 749.68ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 68.0MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 04:31:09,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.59ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 65.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:31:09,098 INFO L158 Benchmark]: Boogie Preprocessor took 39.59ms. Allocated memory is still 117.4MB. Free memory was 65.7MB in the beginning and 63.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:31:09,098 INFO L158 Benchmark]: RCFGBuilder took 1125.18ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 51.2MB in the end (delta: 12.7MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-14 04:31:09,099 INFO L158 Benchmark]: TraceAbstraction took 4883.60ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 50.7MB in the beginning and 153.9MB in the end (delta: -103.2MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2024-11-14 04:31:09,099 INFO L158 Benchmark]: Witness Printer took 7.54ms. Allocated memory is still 268.4MB. Free memory was 153.9MB in the beginning and 153.9MB in the end (delta: 23.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:31:09,106 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.64ms. Allocated memory is still 117.4MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 749.68ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 68.0MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.59ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 65.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.59ms. Allocated memory is still 117.4MB. Free memory was 65.7MB in the beginning and 63.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1125.18ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 51.2MB in the end (delta: 12.7MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4883.60ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 50.7MB in the beginning and 153.9MB in the end (delta: -103.2MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. * Witness Printer took 7.54ms. Allocated memory is still 268.4MB. Free memory was 153.9MB in the beginning and 153.9MB in the end (delta: 23.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-1, t2474=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L745] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-1, t2474=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-1, t2474=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-1, t2474=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "safe029_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 788]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: 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, 51 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 149 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 60 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=823occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 176 SizeOfPredicates, 5 NumberOfNonLiveVariables, 424 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 [2024-11-14 04:31:09,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe9811b-b158-44d5-a655-dc62b5e1943a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample