./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_tso.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_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:41:45,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:41:45,523 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:41:45,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:41:45,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:41:45,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:41:45,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:41:45,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:41:45,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:41:45,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:41:45,571 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:41:45,573 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:41:45,573 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:41:45,573 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:41:45,573 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:41:45,573 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:41:45,573 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:41:45,573 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:41:45,573 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:41:45,574 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:41:45,574 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:41:45,574 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:41:45,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:41:45,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:41:45,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:41:45,575 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:41:45,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:41:45,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:41:45,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:41:45,575 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:41:45,575 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:41:45,575 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:41:45,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:41:45,575 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:41:45,576 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:41:45,576 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:41:45,576 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:41:45,576 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:41:45,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:41:45,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:41:45,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:41:45,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:41:45,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:41:45,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:41:45,578 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:41:45,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:41:45,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:41:45,579 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:41:45,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:41:45,579 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_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2024-11-14 03:41:45,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:41:45,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:41:45,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:41:45,911 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:41:45,912 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:41:45,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i Unable to find full path for "g++" [2024-11-14 03:41:47,710 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:41:48,071 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:41:48,072 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2024-11-14 03:41:48,088 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/data/a89cc429a/2416ed91a61c4a3b8f076a156ce139ce/FLAG53679956f [2024-11-14 03:41:48,106 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/data/a89cc429a/2416ed91a61c4a3b8f076a156ce139ce [2024-11-14 03:41:48,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:41:48,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:41:48,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:41:48,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:41:48,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:41:48,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:41:48" (1/1) ... [2024-11-14 03:41:48,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e92543d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:48, skipping insertion in model container [2024-11-14 03:41:48,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:41:48" (1/1) ... [2024-11-14 03:41:48,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:41:48,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:41:48,703 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:41:48,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:41:48,858 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:41:48,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:48 WrapperNode [2024-11-14 03:41:48,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:41:48,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:41:48,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:41:48,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:41:48,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:48" (1/1) ... [2024-11-14 03:41:48,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:48" (1/1) ... [2024-11-14 03:41:48,933 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2024-11-14 03:41:48,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:41:48,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:41:48,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:41:48,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:41:48,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:48" (1/1) ... [2024-11-14 03:41:48,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:48" (1/1) ... [2024-11-14 03:41:48,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:48" (1/1) ... [2024-11-14 03:41:48,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:48" (1/1) ... [2024-11-14 03:41:48,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:48" (1/1) ... [2024-11-14 03:41:48,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:48" (1/1) ... [2024-11-14 03:41:48,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:48" (1/1) ... [2024-11-14 03:41:48,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:48" (1/1) ... [2024-11-14 03:41:48,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:41:48,987 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:41:48,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:41:48,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:41:48,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:48" (1/1) ... [2024-11-14 03:41:49,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:41:49,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:41:49,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:41:49,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:41:49,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 03:41:49,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:41:49,069 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-14 03:41:49,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-14 03:41:49,070 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-14 03:41:49,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-14 03:41:49,070 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-14 03:41:49,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-14 03:41:49,071 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-14 03:41:49,071 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-14 03:41:49,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:41:49,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 03:41:49,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:41:49,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:41:49,073 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 03:41:49,253 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:41:49,255 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:41:49,740 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 03:41:49,740 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:41:50,002 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:41:50,003 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 03:41:50,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:41:50 BoogieIcfgContainer [2024-11-14 03:41:50,003 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:41:50,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:41:50,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:41:50,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:41:50,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:41:48" (1/3) ... [2024-11-14 03:41:50,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780fce4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:41:50, skipping insertion in model container [2024-11-14 03:41:50,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:48" (2/3) ... [2024-11-14 03:41:50,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780fce4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:41:50, skipping insertion in model container [2024-11-14 03:41:50,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:41:50" (3/3) ... [2024-11-14 03:41:50,016 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2024-11-14 03:41:50,032 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:41:50,035 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix051_tso.oepc.i that has 5 procedures, 52 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-14 03:41:50,035 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 03:41:50,128 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-14 03:41:50,169 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 64 places, 53 transitions, 122 flow [2024-11-14 03:41:52,793 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 40357 states, 40352 states have (on average 4.487187747819191) internal successors, (181067), 40356 states have internal predecessors, (181067), 0 states have call successors, (0), 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 03:41:52,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:41:52,848 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;@31af4c76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:41:52,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-14 03:41:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 40357 states, 40352 states have (on average 4.487187747819191) internal successors, (181067), 40356 states have internal predecessors, (181067), 0 states have call successors, (0), 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 03:41:52,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:41:52,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:41:52,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:41:52,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:41:52,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:41:52,972 INFO L85 PathProgramCache]: Analyzing trace with hash -589101247, now seen corresponding path program 1 times [2024-11-14 03:41:52,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:41:52,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858440012] [2024-11-14 03:41:52,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:41:52,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:41:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:41:53,775 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 03:41:53,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:41:53,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858440012] [2024-11-14 03:41:53,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858440012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:41:53,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:41:53,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:41:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268486496] [2024-11-14 03:41:53,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:41:53,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:41:53,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:41:53,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:41:53,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:41:53,878 INFO L87 Difference]: Start difference. First operand has 40357 states, 40352 states have (on average 4.487187747819191) internal successors, (181067), 40356 states have internal predecessors, (181067), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 03:41:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:41:55,528 INFO L93 Difference]: Finished difference Result 48246 states and 214730 transitions. [2024-11-14 03:41:55,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:41:55,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-14 03:41:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:41:56,614 INFO L225 Difference]: With dead ends: 48246 [2024-11-14 03:41:56,614 INFO L226 Difference]: Without dead ends: 32013 [2024-11-14 03:41:56,665 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 03:41:56,671 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:41:56,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 39 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:41:56,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32013 states. [2024-11-14 03:41:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32013 to 32013. [2024-11-14 03:41:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32013 states, 32011 states have (on average 4.328886945112617) internal successors, (138572), 32012 states have internal predecessors, (138572), 0 states have call successors, (0), 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 03:41:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32013 states to 32013 states and 138572 transitions. [2024-11-14 03:41:59,728 INFO L78 Accepts]: Start accepts. Automaton has 32013 states and 138572 transitions. Word has length 6 [2024-11-14 03:41:59,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:41:59,728 INFO L471 AbstractCegarLoop]: Abstraction has 32013 states and 138572 transitions. [2024-11-14 03:41:59,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 03:41:59,731 INFO L276 IsEmpty]: Start isEmpty. Operand 32013 states and 138572 transitions. [2024-11-14 03:41:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 03:41:59,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:41:59,771 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 03:41:59,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:41:59,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:41:59,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:41:59,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1317713306, now seen corresponding path program 1 times [2024-11-14 03:41:59,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:41:59,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773124232] [2024-11-14 03:41:59,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:41:59,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:41:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:00,074 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 03:42:00,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:00,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773124232] [2024-11-14 03:42:00,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773124232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:00,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:00,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:42:00,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838272548] [2024-11-14 03:42:00,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:00,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:42:00,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:00,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:42:00,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:42:00,081 INFO L87 Difference]: Start difference. First operand 32013 states and 138572 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 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 03:42:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:00,789 INFO L93 Difference]: Finished difference Result 32013 states and 138572 transitions. [2024-11-14 03:42:00,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:42:00,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 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 03:42:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:01,194 INFO L225 Difference]: With dead ends: 32013 [2024-11-14 03:42:01,194 INFO L226 Difference]: Without dead ends: 24810 [2024-11-14 03:42:01,208 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 03:42:01,208 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:01,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 19 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:42:01,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24810 states. [2024-11-14 03:42:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24810 to 24810. [2024-11-14 03:42:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24810 states, 24809 states have (on average 4.299770244669273) internal successors, (106673), 24809 states have internal predecessors, (106673), 0 states have call successors, (0), 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 03:42:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24810 states to 24810 states and 106673 transitions. [2024-11-14 03:42:02,398 INFO L78 Accepts]: Start accepts. Automaton has 24810 states and 106673 transitions. Word has length 17 [2024-11-14 03:42:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:02,400 INFO L471 AbstractCegarLoop]: Abstraction has 24810 states and 106673 transitions. [2024-11-14 03:42:02,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 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 03:42:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 24810 states and 106673 transitions. [2024-11-14 03:42:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 03:42:02,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:02,415 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 03:42:02,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:42:02,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:02,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:02,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1317711957, now seen corresponding path program 1 times [2024-11-14 03:42:02,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:02,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032474017] [2024-11-14 03:42:02,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:02,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:03,522 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 03:42:03,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:03,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032474017] [2024-11-14 03:42:03,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032474017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:03,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:03,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:42:03,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689670033] [2024-11-14 03:42:03,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:03,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:42:03,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:03,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:42:03,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:42:03,526 INFO L87 Difference]: Start difference. First operand 24810 states and 106673 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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 03:42:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:04,587 INFO L93 Difference]: Finished difference Result 35345 states and 150801 transitions. [2024-11-14 03:42:04,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:42:04,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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 03:42:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:04,780 INFO L225 Difference]: With dead ends: 35345 [2024-11-14 03:42:04,781 INFO L226 Difference]: Without dead ends: 23340 [2024-11-14 03:42:04,804 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 03:42:04,807 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 98 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:04,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 144 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:42:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23340 states. [2024-11-14 03:42:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23340 to 23340. [2024-11-14 03:42:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23340 states, 23339 states have (on average 4.2736621106302755) internal successors, (99743), 23339 states have internal predecessors, (99743), 0 states have call successors, (0), 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 03:42:05,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23340 states to 23340 states and 99743 transitions. [2024-11-14 03:42:05,964 INFO L78 Accepts]: Start accepts. Automaton has 23340 states and 99743 transitions. Word has length 17 [2024-11-14 03:42:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:05,964 INFO L471 AbstractCegarLoop]: Abstraction has 23340 states and 99743 transitions. [2024-11-14 03:42:05,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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 03:42:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 23340 states and 99743 transitions. [2024-11-14 03:42:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 03:42:05,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:05,982 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 03:42:05,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:42:05,983 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:05,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:05,983 INFO L85 PathProgramCache]: Analyzing trace with hash -715066359, now seen corresponding path program 1 times [2024-11-14 03:42:05,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:05,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290129642] [2024-11-14 03:42:05,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:05,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:07,567 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 03:42:07,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:07,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290129642] [2024-11-14 03:42:07,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290129642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:07,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:07,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:42:07,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016014743] [2024-11-14 03:42:07,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:07,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:42:07,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:07,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:42:07,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:42:07,569 INFO L87 Difference]: Start difference. First operand 23340 states and 99743 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 03:42:08,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:08,419 INFO L93 Difference]: Finished difference Result 32857 states and 139683 transitions. [2024-11-14 03:42:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:42:08,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 03:42:08,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:08,574 INFO L225 Difference]: With dead ends: 32857 [2024-11-14 03:42:08,575 INFO L226 Difference]: Without dead ends: 23886 [2024-11-14 03:42:08,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:42:08,600 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 114 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:08,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 261 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:42:08,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23886 states. [2024-11-14 03:42:09,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23886 to 23886. [2024-11-14 03:42:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23886 states, 23885 states have (on average 4.262382248272974) internal successors, (101807), 23885 states have internal predecessors, (101807), 0 states have call successors, (0), 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 03:42:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23886 states to 23886 states and 101807 transitions. [2024-11-14 03:42:09,770 INFO L78 Accepts]: Start accepts. Automaton has 23886 states and 101807 transitions. Word has length 19 [2024-11-14 03:42:09,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:09,770 INFO L471 AbstractCegarLoop]: Abstraction has 23886 states and 101807 transitions. [2024-11-14 03:42:09,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 03:42:09,771 INFO L276 IsEmpty]: Start isEmpty. Operand 23886 states and 101807 transitions. [2024-11-14 03:42:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 03:42:09,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:09,810 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 03:42:09,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:42:09,810 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:09,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:09,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1716349647, now seen corresponding path program 1 times [2024-11-14 03:42:09,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:09,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626972044] [2024-11-14 03:42:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:09,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:10,433 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 03:42:10,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:10,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626972044] [2024-11-14 03:42:10,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626972044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:10,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:10,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:42:10,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999303721] [2024-11-14 03:42:10,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:10,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:42:10,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:10,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:42:10,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:42:10,435 INFO L87 Difference]: Start difference. First operand 23886 states and 101807 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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 03:42:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:11,162 INFO L93 Difference]: Finished difference Result 29160 states and 123436 transitions. [2024-11-14 03:42:11,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:42:11,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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 03:42:11,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:11,692 INFO L225 Difference]: With dead ends: 29160 [2024-11-14 03:42:11,692 INFO L226 Difference]: Without dead ends: 22300 [2024-11-14 03:42:11,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:42:11,706 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 138 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:11,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 230 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:42:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22300 states. [2024-11-14 03:42:12,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22300 to 21926. [2024-11-14 03:42:12,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21926 states, 21925 states have (on average 4.244332953249715) internal successors, (93057), 21925 states have internal predecessors, (93057), 0 states have call successors, (0), 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 03:42:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21926 states to 21926 states and 93057 transitions. [2024-11-14 03:42:12,667 INFO L78 Accepts]: Start accepts. Automaton has 21926 states and 93057 transitions. Word has length 20 [2024-11-14 03:42:12,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:12,668 INFO L471 AbstractCegarLoop]: Abstraction has 21926 states and 93057 transitions. [2024-11-14 03:42:12,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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 03:42:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 21926 states and 93057 transitions. [2024-11-14 03:42:12,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:42:12,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:12,699 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] [2024-11-14 03:42:12,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:42:12,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:12,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:12,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1326537704, now seen corresponding path program 1 times [2024-11-14 03:42:12,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:12,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512295053] [2024-11-14 03:42:12,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:12,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:13,157 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 03:42:13,157 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512295053] [2024-11-14 03:42:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512295053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:13,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:13,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:42:13,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634986735] [2024-11-14 03:42:13,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:13,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:42:13,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:13,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:42:13,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:42:13,164 INFO L87 Difference]: Start difference. First operand 21926 states and 93057 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:42:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:13,932 INFO L93 Difference]: Finished difference Result 34386 states and 143679 transitions. [2024-11-14 03:42:13,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:42:13,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-14 03:42:13,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:14,104 INFO L225 Difference]: With dead ends: 34386 [2024-11-14 03:42:14,104 INFO L226 Difference]: Without dead ends: 18494 [2024-11-14 03:42:14,138 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 03:42:14,139 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 76 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:14,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 43 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:42:14,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18494 states. [2024-11-14 03:42:14,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18494 to 18494. [2024-11-14 03:42:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18494 states, 18493 states have (on average 4.104093440761369) internal successors, (75897), 18493 states have internal predecessors, (75897), 0 states have call successors, (0), 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 03:42:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18494 states to 18494 states and 75897 transitions. [2024-11-14 03:42:14,804 INFO L78 Accepts]: Start accepts. Automaton has 18494 states and 75897 transitions. Word has length 21 [2024-11-14 03:42:14,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:14,805 INFO L471 AbstractCegarLoop]: Abstraction has 18494 states and 75897 transitions. [2024-11-14 03:42:14,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:42:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 18494 states and 75897 transitions. [2024-11-14 03:42:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 03:42:14,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:14,828 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] [2024-11-14 03:42:14,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:42:14,828 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:14,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash 631646020, now seen corresponding path program 1 times [2024-11-14 03:42:14,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:14,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926435658] [2024-11-14 03:42:14,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:14,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:15,387 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 03:42:15,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:15,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926435658] [2024-11-14 03:42:15,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926435658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:15,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:15,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:42:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022927124] [2024-11-14 03:42:15,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:15,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:42:15,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:15,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:42:15,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:42:15,390 INFO L87 Difference]: Start difference. First operand 18494 states and 75897 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 03:42:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:15,767 INFO L93 Difference]: Finished difference Result 24094 states and 96769 transitions. [2024-11-14 03:42:15,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:42:15,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-14 03:42:15,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:15,876 INFO L225 Difference]: With dead ends: 24094 [2024-11-14 03:42:15,876 INFO L226 Difference]: Without dead ends: 11634 [2024-11-14 03:42:15,901 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 03:42:15,902 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 140 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:15,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 54 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:42:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11634 states. [2024-11-14 03:42:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11634 to 11310. [2024-11-14 03:42:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11310 states, 11309 states have (on average 3.863736846759218) internal successors, (43695), 11309 states have internal predecessors, (43695), 0 states have call successors, (0), 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 03:42:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11310 states to 11310 states and 43695 transitions. [2024-11-14 03:42:16,281 INFO L78 Accepts]: Start accepts. Automaton has 11310 states and 43695 transitions. Word has length 22 [2024-11-14 03:42:16,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:16,281 INFO L471 AbstractCegarLoop]: Abstraction has 11310 states and 43695 transitions. [2024-11-14 03:42:16,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 03:42:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand 11310 states and 43695 transitions. [2024-11-14 03:42:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:42:16,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:16,303 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, 1, 1, 1, 1] [2024-11-14 03:42:16,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 03:42:16,303 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:16,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:16,304 INFO L85 PathProgramCache]: Analyzing trace with hash -86253855, now seen corresponding path program 1 times [2024-11-14 03:42:16,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:16,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261235346] [2024-11-14 03:42:16,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:16,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:16,619 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 03:42:16,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:16,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261235346] [2024-11-14 03:42:16,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261235346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:16,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:16,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:42:16,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925301924] [2024-11-14 03:42:16,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:16,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:42:16,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:16,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:42:16,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:42:16,623 INFO L87 Difference]: Start difference. First operand 11310 states and 43695 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 03:42:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:17,060 INFO L93 Difference]: Finished difference Result 12638 states and 48103 transitions. [2024-11-14 03:42:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:42:17,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-14 03:42:17,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:17,159 INFO L225 Difference]: With dead ends: 12638 [2024-11-14 03:42:17,159 INFO L226 Difference]: Without dead ends: 7038 [2024-11-14 03:42:17,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:42:17,173 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 176 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:17,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 69 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:42:17,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7038 states. [2024-11-14 03:42:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7038 to 6930. [2024-11-14 03:42:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6930 states, 6929 states have (on average 3.780199162938375) internal successors, (26193), 6929 states have internal predecessors, (26193), 0 states have call successors, (0), 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 03:42:17,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6930 states to 6930 states and 26193 transitions. [2024-11-14 03:42:17,579 INFO L78 Accepts]: Start accepts. Automaton has 6930 states and 26193 transitions. Word has length 27 [2024-11-14 03:42:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:17,581 INFO L471 AbstractCegarLoop]: Abstraction has 6930 states and 26193 transitions. [2024-11-14 03:42:17,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 03:42:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 6930 states and 26193 transitions. [2024-11-14 03:42:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 03:42:17,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:17,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:42:17,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 03:42:17,603 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:17,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:17,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1840232669, now seen corresponding path program 1 times [2024-11-14 03:42:17,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:17,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403773463] [2024-11-14 03:42:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:17,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:18,394 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 03:42:18,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:18,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403773463] [2024-11-14 03:42:18,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403773463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:18,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:18,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:42:18,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537583107] [2024-11-14 03:42:18,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:18,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:42:18,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:18,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:42:18,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:42:18,397 INFO L87 Difference]: Start difference. First operand 6930 states and 26193 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 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 03:42:19,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:19,128 INFO L93 Difference]: Finished difference Result 10418 states and 38757 transitions. [2024-11-14 03:42:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:42:19,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-14 03:42:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:19,217 INFO L225 Difference]: With dead ends: 10418 [2024-11-14 03:42:19,217 INFO L226 Difference]: Without dead ends: 7090 [2024-11-14 03:42:19,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:42:19,226 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 129 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:19,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 206 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:42:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7090 states. [2024-11-14 03:42:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7090 to 6930. [2024-11-14 03:42:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6930 states, 6929 states have (on average 3.6959157165536154) internal successors, (25609), 6929 states have internal predecessors, (25609), 0 states have call successors, (0), 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 03:42:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6930 states to 6930 states and 25609 transitions. [2024-11-14 03:42:19,498 INFO L78 Accepts]: Start accepts. Automaton has 6930 states and 25609 transitions. Word has length 32 [2024-11-14 03:42:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:19,498 INFO L471 AbstractCegarLoop]: Abstraction has 6930 states and 25609 transitions. [2024-11-14 03:42:19,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 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 03:42:19,499 INFO L276 IsEmpty]: Start isEmpty. Operand 6930 states and 25609 transitions. [2024-11-14 03:42:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 03:42:19,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:19,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:42:19,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 03:42:19,518 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:19,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:19,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1506945373, now seen corresponding path program 2 times [2024-11-14 03:42:19,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:19,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118528798] [2024-11-14 03:42:19,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:19,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:20,065 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 03:42:20,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:20,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118528798] [2024-11-14 03:42:20,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118528798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:20,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:20,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:42:20,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6002894] [2024-11-14 03:42:20,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:20,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:42:20,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:20,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:42:20,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:42:20,067 INFO L87 Difference]: Start difference. First operand 6930 states and 25609 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 03:42:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:20,428 INFO L93 Difference]: Finished difference Result 7058 states and 25977 transitions. [2024-11-14 03:42:20,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:42:20,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-14 03:42:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:20,498 INFO L225 Difference]: With dead ends: 7058 [2024-11-14 03:42:20,498 INFO L226 Difference]: Without dead ends: 4050 [2024-11-14 03:42:20,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:42:20,506 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 220 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:20,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 53 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:42:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2024-11-14 03:42:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 4050. [2024-11-14 03:42:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 4049 states have (on average 3.701654729562855) internal successors, (14988), 4049 states have internal predecessors, (14988), 0 states have call successors, (0), 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 03:42:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 14988 transitions. [2024-11-14 03:42:20,702 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 14988 transitions. Word has length 32 [2024-11-14 03:42:20,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:20,703 INFO L471 AbstractCegarLoop]: Abstraction has 4050 states and 14988 transitions. [2024-11-14 03:42:20,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 03:42:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 14988 transitions. [2024-11-14 03:42:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:42:20,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:20,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:42:20,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 03:42:20,717 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:20,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:20,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1574979931, now seen corresponding path program 1 times [2024-11-14 03:42:20,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:20,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212845848] [2024-11-14 03:42:20,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:20,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:21,490 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 03:42:21,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:21,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212845848] [2024-11-14 03:42:21,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212845848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:21,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:21,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:42:21,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375035185] [2024-11-14 03:42:21,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:21,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:42:21,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:21,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:42:21,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:42:21,492 INFO L87 Difference]: Start difference. First operand 4050 states and 14988 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:42:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:22,078 INFO L93 Difference]: Finished difference Result 5538 states and 20320 transitions. [2024-11-14 03:42:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:42:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-14 03:42:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:22,139 INFO L225 Difference]: With dead ends: 5538 [2024-11-14 03:42:22,139 INFO L226 Difference]: Without dead ends: 2610 [2024-11-14 03:42:22,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:42:22,146 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 81 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:22,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 170 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:42:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2024-11-14 03:42:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2024-11-14 03:42:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2609 states have (on average 3.5944806439248755) internal successors, (9378), 2609 states have internal predecessors, (9378), 0 states have call successors, (0), 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 03:42:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 9378 transitions. [2024-11-14 03:42:22,280 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 9378 transitions. Word has length 37 [2024-11-14 03:42:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:22,280 INFO L471 AbstractCegarLoop]: Abstraction has 2610 states and 9378 transitions. [2024-11-14 03:42:22,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:42:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 9378 transitions. [2024-11-14 03:42:22,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:42:22,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:22,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:42:22,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 03:42:22,292 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:22,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:22,293 INFO L85 PathProgramCache]: Analyzing trace with hash 727409163, now seen corresponding path program 2 times [2024-11-14 03:42:22,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:22,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791176989] [2024-11-14 03:42:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:22,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:22,951 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 03:42:22,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:22,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791176989] [2024-11-14 03:42:22,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791176989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:22,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:22,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:42:22,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230293551] [2024-11-14 03:42:22,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:22,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:42:22,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:22,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:42:22,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:42:22,954 INFO L87 Difference]: Start difference. First operand 2610 states and 9378 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:42:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:23,370 INFO L93 Difference]: Finished difference Result 3698 states and 13218 transitions. [2024-11-14 03:42:23,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:42:23,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-14 03:42:23,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:23,423 INFO L225 Difference]: With dead ends: 3698 [2024-11-14 03:42:23,423 INFO L226 Difference]: Without dead ends: 1530 [2024-11-14 03:42:23,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:42:23,428 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 82 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:23,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 131 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:42:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2024-11-14 03:42:23,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1530. [2024-11-14 03:42:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1529 states have (on average 3.4257684761281886) internal successors, (5238), 1529 states have internal predecessors, (5238), 0 states have call successors, (0), 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 03:42:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 5238 transitions. [2024-11-14 03:42:23,508 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 5238 transitions. Word has length 37 [2024-11-14 03:42:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:23,509 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 5238 transitions. [2024-11-14 03:42:23,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:42:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 5238 transitions. [2024-11-14 03:42:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:42:23,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:23,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:42:23,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 03:42:23,514 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:23,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:23,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1795847189, now seen corresponding path program 3 times [2024-11-14 03:42:23,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:23,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423479445] [2024-11-14 03:42:23,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:23,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:26,355 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 03:42:26,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:26,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423479445] [2024-11-14 03:42:26,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423479445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:26,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:26,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 03:42:26,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448587717] [2024-11-14 03:42:26,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:26,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:42:26,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:26,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:42:26,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:42:26,358 INFO L87 Difference]: Start difference. First operand 1530 states and 5238 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:42:27,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:27,098 INFO L93 Difference]: Finished difference Result 3138 states and 10586 transitions. [2024-11-14 03:42:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:42:27,099 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-14 03:42:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:27,154 INFO L225 Difference]: With dead ends: 3138 [2024-11-14 03:42:27,154 INFO L226 Difference]: Without dead ends: 1706 [2024-11-14 03:42:27,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-14 03:42:27,157 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 116 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:27,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 294 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:42:27,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-11-14 03:42:27,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1290. [2024-11-14 03:42:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1289 states have (on average 3.365399534522886) internal successors, (4338), 1289 states have internal predecessors, (4338), 0 states have call successors, (0), 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 03:42:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 4338 transitions. [2024-11-14 03:42:27,226 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 4338 transitions. Word has length 37 [2024-11-14 03:42:27,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:27,227 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 4338 transitions. [2024-11-14 03:42:27,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:42:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 4338 transitions. [2024-11-14 03:42:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:42:27,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:27,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:42:27,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 03:42:27,229 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:27,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash -712596023, now seen corresponding path program 4 times [2024-11-14 03:42:27,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:27,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064391454] [2024-11-14 03:42:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:27,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:30,524 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 03:42:30,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:30,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064391454] [2024-11-14 03:42:30,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064391454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:30,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:30,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:42:30,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979870546] [2024-11-14 03:42:30,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:30,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:42:30,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:30,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:42:30,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:42:30,526 INFO L87 Difference]: Start difference. First operand 1290 states and 4338 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:42:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:31,097 INFO L93 Difference]: Finished difference Result 1706 states and 5682 transitions. [2024-11-14 03:42:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:42:31,098 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-14 03:42:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:31,155 INFO L225 Difference]: With dead ends: 1706 [2024-11-14 03:42:31,155 INFO L226 Difference]: Without dead ends: 930 [2024-11-14 03:42:31,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-14 03:42:31,158 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 180 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:31,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 111 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:42:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2024-11-14 03:42:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2024-11-14 03:42:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 929 states have (on average 3.209903121636168) internal successors, (2982), 929 states have internal predecessors, (2982), 0 states have call successors, (0), 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 03:42:31,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 2982 transitions. [2024-11-14 03:42:31,241 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 2982 transitions. Word has length 37 [2024-11-14 03:42:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:31,242 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 2982 transitions. [2024-11-14 03:42:31,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:42:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 2982 transitions. [2024-11-14 03:42:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:42:31,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:31,245 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:42:31,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 03:42:31,246 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:31,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:31,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1958562837, now seen corresponding path program 5 times [2024-11-14 03:42:31,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:31,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954996956] [2024-11-14 03:42:31,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:31,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:42:31,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:42:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:42:31,562 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 03:42:31,562 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:42:31,563 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-14 03:42:31,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-14 03:42:31,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-14 03:42:31,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-14 03:42:31,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-14 03:42:31,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-14 03:42:31,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-14 03:42:31,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-14 03:42:31,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 03:42:31,575 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:42:31,707 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 03:42:31,707 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:42:31,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:42:31 BasicIcfg [2024-11-14 03:42:31,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:42:31,712 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:42:31,712 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:42:31,712 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:42:31,713 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:41:50" (3/4) ... [2024-11-14 03:42:31,715 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 03:42:31,715 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:42:31,718 INFO L158 Benchmark]: Toolchain (without parser) took 43605.81ms. Allocated memory was 117.4MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 91.0MB in the beginning and 7.1GB in the end (delta: -7.1GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2024-11-14 03:42:31,718 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:42:31,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 747.00ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 67.1MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 03:42:31,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.86ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 64.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:42:31,719 INFO L158 Benchmark]: Boogie Preprocessor took 52.60ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 62.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:42:31,719 INFO L158 Benchmark]: RCFGBuilder took 1016.06ms. Allocated memory is still 117.4MB. Free memory was 62.6MB in the beginning and 59.9MB in the end (delta: 2.6MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-11-14 03:42:31,720 INFO L158 Benchmark]: TraceAbstraction took 41704.85ms. Allocated memory was 117.4MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 59.4MB in the beginning and 7.1GB in the end (delta: -7.1GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2024-11-14 03:42:31,720 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 10.8GB. Free memory was 7.1GB in the beginning and 7.1GB in the end (delta: 78.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:42:31,722 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.31ms. Allocated memory is still 117.4MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 747.00ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 67.1MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.86ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 64.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.60ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 62.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1016.06ms. Allocated memory is still 117.4MB. Free memory was 62.6MB in the beginning and 59.9MB in the end (delta: 2.6MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * TraceAbstraction took 41704.85ms. Allocated memory was 117.4MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 59.4MB in the beginning and 7.1GB in the end (delta: -7.1GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 10.8GB. Free memory was 7.1GB in the beginning and 7.1GB in the end (delta: 78.9kB). 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L820] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L883] 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}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix051_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - 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: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 851]: 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: 849]: 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: 855]: 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 9 procedures, 85 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 41.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.4s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1607 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1607 mSDsluCounter, 1824 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1386 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2332 IncrementalHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 438 mSDtfsCounter, 2332 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40357occurred in iteration=0, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 1382 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 398 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 347 ConstructedInterpolants, 0 QuantifiedInterpolants, 3392 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 03:42:31,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:42:34,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:42:34,884 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 03:42:34,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:42:34,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:42:34,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:42:34,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:42:34,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:42:34,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:42:34,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:42:34,930 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:42:34,931 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:42:34,931 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:42:34,931 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:42:34,931 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:42:34,931 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:42:34,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:42:34,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:42:34,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:42:34,932 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:42:34,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:42:34,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:42:34,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:42:34,933 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:42:34,933 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:42:34,933 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:42:34,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:42:34,933 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:42:34,934 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 03:42:34,934 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:42:34,934 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 03:42:34,934 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:42:34,934 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:42:34,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:42:34,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:42:34,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 03:42:34,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:42:34,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:42:34,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:42:34,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:42:34,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:42:34,936 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 03:42:34,936 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 03:42:34,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:42:34,936 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:42:34,937 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_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2024-11-14 03:42:35,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:42:35,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:42:35,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:42:35,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:42:35,391 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:42:35,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i Unable to find full path for "g++" [2024-11-14 03:42:37,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:42:37,992 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:42:37,993 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2024-11-14 03:42:38,024 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/data/e85d13e0a/439137a9fb9b499aa5b390e259cccaf1/FLAGc65c3701c [2024-11-14 03:42:38,130 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/data/e85d13e0a/439137a9fb9b499aa5b390e259cccaf1 [2024-11-14 03:42:38,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:42:38,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:42:38,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:42:38,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:42:38,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:42:38,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:42:38" (1/1) ... [2024-11-14 03:42:38,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f4accc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:42:38, skipping insertion in model container [2024-11-14 03:42:38,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:42:38" (1/1) ... [2024-11-14 03:42:38,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:42:38,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:42:38,608 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:42:38,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:42:38,733 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:42:38,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:42:38 WrapperNode [2024-11-14 03:42:38,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:42:38,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:42:38,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:42:38,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:42:38,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:42:38" (1/1) ... [2024-11-14 03:42:38,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:42:38" (1/1) ... [2024-11-14 03:42:38,797 INFO L138 Inliner]: procedures = 177, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2024-11-14 03:42:38,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:42:38,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:42:38,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:42:38,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:42:38,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:42:38" (1/1) ... [2024-11-14 03:42:38,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:42:38" (1/1) ... [2024-11-14 03:42:38,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:42:38" (1/1) ... [2024-11-14 03:42:38,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:42:38" (1/1) ... [2024-11-14 03:42:38,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:42:38" (1/1) ... [2024-11-14 03:42:38,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:42:38" (1/1) ... [2024-11-14 03:42:38,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:42:38" (1/1) ... [2024-11-14 03:42:38,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:42:38" (1/1) ... [2024-11-14 03:42:38,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:42:38,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:42:38,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:42:38,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:42:38,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:42:38" (1/1) ... [2024-11-14 03:42:38,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:42:38,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:42:38,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:42:38,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:42:38,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 03:42:38,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:42:38,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 03:42:38,918 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-14 03:42:38,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-14 03:42:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-14 03:42:38,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-14 03:42:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-14 03:42:38,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-14 03:42:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-14 03:42:38,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-14 03:42:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 03:42:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:42:38,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:42:38,921 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 03:42:39,143 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:42:39,144 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:42:39,668 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 03:42:39,668 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:42:40,037 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:42:40,038 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 03:42:40,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:42:40 BoogieIcfgContainer [2024-11-14 03:42:40,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:42:40,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:42:40,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:42:40,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:42:40,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:42:38" (1/3) ... [2024-11-14 03:42:40,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a107a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:42:40, skipping insertion in model container [2024-11-14 03:42:40,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:42:38" (2/3) ... [2024-11-14 03:42:40,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a107a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:42:40, skipping insertion in model container [2024-11-14 03:42:40,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:42:40" (3/3) ... [2024-11-14 03:42:40,055 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2024-11-14 03:42:40,074 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:42:40,077 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix051_tso.oepc.i that has 5 procedures, 52 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-14 03:42:40,078 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 03:42:40,167 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-14 03:42:40,203 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 64 places, 53 transitions, 122 flow [2024-11-14 03:42:42,833 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 40357 states, 40352 states have (on average 4.487187747819191) internal successors, (181067), 40356 states have internal predecessors, (181067), 0 states have call successors, (0), 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 03:42:43,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:42:43,025 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;@9e34b08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:42:43,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-14 03:42:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 40357 states, 40352 states have (on average 4.487187747819191) internal successors, (181067), 40356 states have internal predecessors, (181067), 0 states have call successors, (0), 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 03:42:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:42:43,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:43,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:42:43,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:43,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:43,143 INFO L85 PathProgramCache]: Analyzing trace with hash -529934335, now seen corresponding path program 1 times [2024-11-14 03:42:43,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:42:43,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688137396] [2024-11-14 03:42:43,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:43,216 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 03:42:43,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:42:43,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:43,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:43,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:42:43,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:42:43,422 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 03:42:43,423 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:42:43,423 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:42:43,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688137396] [2024-11-14 03:42:43,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688137396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:43,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:43,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:42:43,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664967787] [2024-11-14 03:42:43,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:43,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:42:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:42:43,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:42:43,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:42:43,530 INFO L87 Difference]: Start difference. First operand has 40357 states, 40352 states have (on average 4.487187747819191) internal successors, (181067), 40356 states have internal predecessors, (181067), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 03:42:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:44,883 INFO L93 Difference]: Finished difference Result 48246 states and 214730 transitions. [2024-11-14 03:42:44,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:42:44,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-14 03:42:44,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:45,577 INFO L225 Difference]: With dead ends: 48246 [2024-11-14 03:42:45,581 INFO L226 Difference]: Without dead ends: 32013 [2024-11-14 03:42:45,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 03:42:45,638 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:45,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 39 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:42:45,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32013 states. [2024-11-14 03:42:47,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32013 to 32013. [2024-11-14 03:42:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32013 states, 32011 states have (on average 4.328886945112617) internal successors, (138572), 32012 states have internal predecessors, (138572), 0 states have call successors, (0), 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 03:42:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32013 states to 32013 states and 138572 transitions. [2024-11-14 03:42:48,201 INFO L78 Accepts]: Start accepts. Automaton has 32013 states and 138572 transitions. Word has length 6 [2024-11-14 03:42:48,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:48,206 INFO L471 AbstractCegarLoop]: Abstraction has 32013 states and 138572 transitions. [2024-11-14 03:42:48,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 03:42:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 32013 states and 138572 transitions. [2024-11-14 03:42:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 03:42:48,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:48,248 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 03:42:48,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:48,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:48,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:48,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash -238860184, now seen corresponding path program 1 times [2024-11-14 03:42:48,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:42:48,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616782699] [2024-11-14 03:42:48,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:48,453 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 03:42:48,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:42:48,455 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:48,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:48,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:42:48,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:42:48,641 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 03:42:48,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:42:48,641 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:42:48,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616782699] [2024-11-14 03:42:48,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616782699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:48,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:48,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:42:48,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593059265] [2024-11-14 03:42:48,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:48,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:42:48,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:42:48,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:42:48,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:42:48,644 INFO L87 Difference]: Start difference. First operand 32013 states and 138572 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:42:50,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:50,166 INFO L93 Difference]: Finished difference Result 51549 states and 219384 transitions. [2024-11-14 03:42:50,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:42:50,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 03:42:50,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:50,476 INFO L225 Difference]: With dead ends: 51549 [2024-11-14 03:42:50,480 INFO L226 Difference]: Without dead ends: 25138 [2024-11-14 03:42:50,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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 03:42:50,538 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 76 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:50,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 49 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:42:50,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25138 states. [2024-11-14 03:42:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25138 to 25138. [2024-11-14 03:42:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25138 states, 25136 states have (on average 4.145329408020369) internal successors, (104197), 25137 states have internal predecessors, (104197), 0 states have call successors, (0), 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 03:42:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25138 states to 25138 states and 104197 transitions. [2024-11-14 03:42:51,940 INFO L78 Accepts]: Start accepts. Automaton has 25138 states and 104197 transitions. Word has length 17 [2024-11-14 03:42:51,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:51,941 INFO L471 AbstractCegarLoop]: Abstraction has 25138 states and 104197 transitions. [2024-11-14 03:42:51,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:42:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 25138 states and 104197 transitions. [2024-11-14 03:42:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 03:42:51,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:51,975 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] [2024-11-14 03:42:51,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:52,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:52,179 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:52,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:52,179 INFO L85 PathProgramCache]: Analyzing trace with hash -170911895, now seen corresponding path program 1 times [2024-11-14 03:42:52,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:42:52,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440054965] [2024-11-14 03:42:52,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:52,180 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 03:42:52,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:42:52,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:52,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:52,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:42:52,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:42:52,458 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 03:42:52,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:42:52,460 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:42:52,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440054965] [2024-11-14 03:42:52,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440054965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:52,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:52,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:42:52,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706475382] [2024-11-14 03:42:52,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:52,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:42:52,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:42:52,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:42:52,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:42:52,462 INFO L87 Difference]: Start difference. First operand 25138 states and 104197 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 03:42:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:53,436 INFO L93 Difference]: Finished difference Result 33674 states and 136509 transitions. [2024-11-14 03:42:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:42:53,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-14 03:42:53,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:53,580 INFO L225 Difference]: With dead ends: 33674 [2024-11-14 03:42:53,580 INFO L226 Difference]: Without dead ends: 14138 [2024-11-14 03:42:53,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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 03:42:53,622 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 128 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:53,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 75 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:42:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14138 states. [2024-11-14 03:42:54,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14138 to 14138. [2024-11-14 03:42:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14138 states, 14136 states have (on average 3.869340690435767) internal successors, (54697), 14137 states have internal predecessors, (54697), 0 states have call successors, (0), 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 03:42:54,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14138 states to 14138 states and 54697 transitions. [2024-11-14 03:42:54,283 INFO L78 Accepts]: Start accepts. Automaton has 14138 states and 54697 transitions. Word has length 22 [2024-11-14 03:42:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:54,283 INFO L471 AbstractCegarLoop]: Abstraction has 14138 states and 54697 transitions. [2024-11-14 03:42:54,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 03:42:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 14138 states and 54697 transitions. [2024-11-14 03:42:54,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:42:54,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:54,315 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, 1, 1, 1, 1] [2024-11-14 03:42:54,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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)] Forceful destruction successful, exit code 0 [2024-11-14 03:42:54,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:54,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:54,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:54,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1057210345, now seen corresponding path program 1 times [2024-11-14 03:42:54,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:42:54,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799611481] [2024-11-14 03:42:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:54,520 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 03:42:54,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:42:54,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:54,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:54,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:42:54,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:42:54,821 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 03:42:54,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:42:54,822 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:42:54,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799611481] [2024-11-14 03:42:54,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799611481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:54,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:54,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:42:54,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768563563] [2024-11-14 03:42:54,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:54,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:42:54,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:42:54,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:42:54,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:42:54,825 INFO L87 Difference]: Start difference. First operand 14138 states and 54697 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 03:42:55,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:55,821 INFO L93 Difference]: Finished difference Result 16074 states and 61209 transitions. [2024-11-14 03:42:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:42:55,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-14 03:42:55,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:55,902 INFO L225 Difference]: With dead ends: 16074 [2024-11-14 03:42:55,902 INFO L226 Difference]: Without dead ends: 7538 [2024-11-14 03:42:55,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:42:55,918 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 176 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:55,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 134 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 03:42:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7538 states. [2024-11-14 03:42:56,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7538 to 7538. [2024-11-14 03:42:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7538 states, 7536 states have (on average 3.7549097664543525) internal successors, (28297), 7537 states have internal predecessors, (28297), 0 states have call successors, (0), 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 03:42:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7538 states to 7538 states and 28297 transitions. [2024-11-14 03:42:56,165 INFO L78 Accepts]: Start accepts. Automaton has 7538 states and 28297 transitions. Word has length 27 [2024-11-14 03:42:56,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:56,166 INFO L471 AbstractCegarLoop]: Abstraction has 7538 states and 28297 transitions. [2024-11-14 03:42:56,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 03:42:56,167 INFO L276 IsEmpty]: Start isEmpty. Operand 7538 states and 28297 transitions. [2024-11-14 03:42:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 03:42:56,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:56,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:42:56,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:56,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:56,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:56,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1021673835, now seen corresponding path program 1 times [2024-11-14 03:42:56,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:42:56,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89564212] [2024-11-14 03:42:56,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:56,395 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 03:42:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:42:56,398 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:56,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:56,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:42:56,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:42:56,659 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 03:42:56,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:42:56,660 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:42:56,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89564212] [2024-11-14 03:42:56,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89564212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:56,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:56,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:42:56,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738884137] [2024-11-14 03:42:56,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:56,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:42:56,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:42:56,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:42:56,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:42:56,662 INFO L87 Difference]: Start difference. First operand 7538 states and 28297 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 03:42:57,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:57,136 INFO L93 Difference]: Finished difference Result 7714 states and 28809 transitions. [2024-11-14 03:42:57,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:42:57,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-14 03:42:57,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:57,200 INFO L225 Difference]: With dead ends: 7714 [2024-11-14 03:42:57,200 INFO L226 Difference]: Without dead ends: 5778 [2024-11-14 03:42:57,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:42:57,206 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 200 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:57,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 200 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:42:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5778 states. [2024-11-14 03:42:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5778 to 5778. [2024-11-14 03:42:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5778 states, 5776 states have (on average 3.832583102493075) internal successors, (22137), 5777 states have internal predecessors, (22137), 0 states have call successors, (0), 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 03:42:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5778 states to 5778 states and 22137 transitions. [2024-11-14 03:42:57,445 INFO L78 Accepts]: Start accepts. Automaton has 5778 states and 22137 transitions. Word has length 32 [2024-11-14 03:42:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:57,445 INFO L471 AbstractCegarLoop]: Abstraction has 5778 states and 22137 transitions. [2024-11-14 03:42:57,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 03:42:57,446 INFO L276 IsEmpty]: Start isEmpty. Operand 5778 states and 22137 transitions. [2024-11-14 03:42:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:42:57,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:57,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:42:57,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:57,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:57,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:57,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:57,664 INFO L85 PathProgramCache]: Analyzing trace with hash 593864092, now seen corresponding path program 1 times [2024-11-14 03:42:57,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:42:57,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368419919] [2024-11-14 03:42:57,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:57,665 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 03:42:57,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:42:57,667 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:57,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:58,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 03:42:58,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:42:58,107 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 03:42:58,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:42:58,108 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:42:58,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368419919] [2024-11-14 03:42:58,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368419919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:58,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:58,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:42:58,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366607805] [2024-11-14 03:42:58,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:58,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:42:58,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:42:58,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:42:58,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:42:58,109 INFO L87 Difference]: Start difference. First operand 5778 states and 22137 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:42:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:58,193 INFO L93 Difference]: Finished difference Result 5778 states and 22137 transitions. [2024-11-14 03:42:58,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:42:58,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-14 03:42:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:58,251 INFO L225 Difference]: With dead ends: 5778 [2024-11-14 03:42:58,251 INFO L226 Difference]: Without dead ends: 5730 [2024-11-14 03:42:58,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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 03:42:58,255 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:58,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:42:58,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5730 states. [2024-11-14 03:42:58,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5730 to 5730. [2024-11-14 03:42:58,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5730 states, 5729 states have (on average 3.8388898586140687) internal successors, (21993), 5729 states have internal predecessors, (21993), 0 states have call successors, (0), 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 03:42:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5730 states to 5730 states and 21993 transitions. [2024-11-14 03:42:58,439 INFO L78 Accepts]: Start accepts. Automaton has 5730 states and 21993 transitions. Word has length 37 [2024-11-14 03:42:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:58,441 INFO L471 AbstractCegarLoop]: Abstraction has 5730 states and 21993 transitions. [2024-11-14 03:42:58,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:42:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 5730 states and 21993 transitions. [2024-11-14 03:42:58,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:42:58,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:58,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:42:58,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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)] Forceful destruction successful, exit code 0 [2024-11-14 03:42:58,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:58,660 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:58,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:58,661 INFO L85 PathProgramCache]: Analyzing trace with hash 593865441, now seen corresponding path program 1 times [2024-11-14 03:42:58,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:42:58,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316470023] [2024-11-14 03:42:58,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:58,661 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 03:42:58,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:42:58,663 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:58,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 (8)] Waiting until timeout for monitored process [2024-11-14 03:42:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:58,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:42:58,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:42:59,014 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 03:42:59,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:42:59,015 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:42:59,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316470023] [2024-11-14 03:42:59,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316470023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:42:59,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:42:59,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:42:59,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209417442] [2024-11-14 03:42:59,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:59,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:42:59,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:42:59,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:42:59,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:42:59,018 INFO L87 Difference]: Start difference. First operand 5730 states and 21993 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:42:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:59,353 INFO L93 Difference]: Finished difference Result 7818 states and 29755 transitions. [2024-11-14 03:42:59,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:42:59,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-14 03:42:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:59,404 INFO L225 Difference]: With dead ends: 7818 [2024-11-14 03:42:59,404 INFO L226 Difference]: Without dead ends: 3690 [2024-11-14 03:42:59,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:42:59,413 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 61 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:59,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 149 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:42:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2024-11-14 03:42:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3690. [2024-11-14 03:42:59,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 3689 states have (on average 3.7294659799403633) internal successors, (13758), 3689 states have internal predecessors, (13758), 0 states have call successors, (0), 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 03:42:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 13758 transitions. [2024-11-14 03:42:59,549 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 13758 transitions. Word has length 37 [2024-11-14 03:42:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:59,550 INFO L471 AbstractCegarLoop]: Abstraction has 3690 states and 13758 transitions. [2024-11-14 03:42:59,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:42:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 13758 transitions. [2024-11-14 03:42:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:42:59,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:59,561 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:42:59,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 (8)] Ended with exit code 0 [2024-11-14 03:42:59,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:59,764 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:42:59,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:59,765 INFO L85 PathProgramCache]: Analyzing trace with hash 497285891, now seen corresponding path program 2 times [2024-11-14 03:42:59,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:42:59,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989496571] [2024-11-14 03:42:59,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:42:59,765 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 03:42:59,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:42:59,768 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:42:59,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 (9)] Waiting until timeout for monitored process [2024-11-14 03:42:59,903 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-14 03:42:59,903 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:42:59,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:42:59,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:43:00,308 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 03:43:00,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:43:00,309 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:43:00,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989496571] [2024-11-14 03:43:00,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989496571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:43:00,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:43:00,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:43:00,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564902911] [2024-11-14 03:43:00,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:43:00,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:43:00,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:43:00,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:43:00,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:43:00,311 INFO L87 Difference]: Start difference. First operand 3690 states and 13758 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:43:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:43:00,620 INFO L93 Difference]: Finished difference Result 5258 states and 19334 transitions. [2024-11-14 03:43:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:43:00,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-14 03:43:00,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:43:00,670 INFO L225 Difference]: With dead ends: 5258 [2024-11-14 03:43:00,670 INFO L226 Difference]: Without dead ends: 2610 [2024-11-14 03:43:00,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:43:00,676 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 55 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:43:00,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 152 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:43:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2024-11-14 03:43:00,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2024-11-14 03:43:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2609 states have (on average 3.5944806439248755) internal successors, (9378), 2609 states have internal predecessors, (9378), 0 states have call successors, (0), 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 03:43:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 9378 transitions. [2024-11-14 03:43:00,802 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 9378 transitions. Word has length 37 [2024-11-14 03:43:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:43:00,803 INFO L471 AbstractCegarLoop]: Abstraction has 2610 states and 9378 transitions. [2024-11-14 03:43:00,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:43:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 9378 transitions. [2024-11-14 03:43:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:43:00,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:43:00,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:43:00,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 (9)] Forceful destruction successful, exit code 0 [2024-11-14 03:43:01,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:43:01,012 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:43:01,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:43:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1406451399, now seen corresponding path program 3 times [2024-11-14 03:43:01,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:43:01,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244973110] [2024-11-14 03:43:01,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:43:01,013 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 03:43:01,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:43:01,015 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:43:01,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 (10)] Waiting until timeout for monitored process [2024-11-14 03:43:01,166 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-14 03:43:01,166 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:43:01,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:43:01,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:43:01,485 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 03:43:01,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:43:01,485 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:43:01,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244973110] [2024-11-14 03:43:01,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244973110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:43:01,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:43:01,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:43:01,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931349367] [2024-11-14 03:43:01,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:43:01,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:43:01,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:43:01,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:43:01,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:43:01,488 INFO L87 Difference]: Start difference. First operand 2610 states and 9378 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:43:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:43:01,755 INFO L93 Difference]: Finished difference Result 3698 states and 13218 transitions. [2024-11-14 03:43:01,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:43:01,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-14 03:43:01,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:43:01,802 INFO L225 Difference]: With dead ends: 3698 [2024-11-14 03:43:01,802 INFO L226 Difference]: Without dead ends: 1530 [2024-11-14 03:43:01,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:43:01,807 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 51 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:43:01,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 128 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:43:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2024-11-14 03:43:01,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1530. [2024-11-14 03:43:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1529 states have (on average 3.4257684761281886) internal successors, (5238), 1529 states have internal predecessors, (5238), 0 states have call successors, (0), 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 03:43:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 5238 transitions. [2024-11-14 03:43:01,895 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 5238 transitions. Word has length 37 [2024-11-14 03:43:01,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:43:01,896 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 5238 transitions. [2024-11-14 03:43:01,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:43:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 5238 transitions. [2024-11-14 03:43:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:43:01,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:43:01,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:43:01,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 (10)] Ended with exit code 0 [2024-11-14 03:43:02,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:43:02,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:43:02,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:43:02,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1114331283, now seen corresponding path program 4 times [2024-11-14 03:43:02,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:43:02,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782481077] [2024-11-14 03:43:02,111 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:43:02,111 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 03:43:02,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:43:02,113 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:43:02,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 (11)] Waiting until timeout for monitored process [2024-11-14 03:43:02,245 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:43:02,245 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:43:02,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 03:43:02,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:43:02,538 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 03:43:02,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:43:02,538 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:43:02,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782481077] [2024-11-14 03:43:02,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782481077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:43:02,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:43:02,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:43:02,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165957994] [2024-11-14 03:43:02,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:43:02,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:43:02,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:43:02,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:43:02,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:43:02,542 INFO L87 Difference]: Start difference. First operand 1530 states and 5238 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:43:02,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:43:02,839 INFO L93 Difference]: Finished difference Result 2962 states and 10048 transitions. [2024-11-14 03:43:02,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:43:02,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-14 03:43:02,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:43:02,887 INFO L225 Difference]: With dead ends: 2962 [2024-11-14 03:43:02,888 INFO L226 Difference]: Without dead ends: 1850 [2024-11-14 03:43:02,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:43:02,891 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 65 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:43:02,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 178 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:43:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2024-11-14 03:43:02,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1344. [2024-11-14 03:43:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1343 states have (on average 3.3976172747580047) internal successors, (4563), 1343 states have internal predecessors, (4563), 0 states have call successors, (0), 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 03:43:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 4563 transitions. [2024-11-14 03:43:02,998 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 4563 transitions. Word has length 37 [2024-11-14 03:43:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:43:02,998 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 4563 transitions. [2024-11-14 03:43:02,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:43:02,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 4563 transitions. [2024-11-14 03:43:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:43:03,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:43:03,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:43:03,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 (11)] Forceful destruction successful, exit code 0 [2024-11-14 03:43:03,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:43:03,203 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:43:03,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:43:03,204 INFO L85 PathProgramCache]: Analyzing trace with hash -31080117, now seen corresponding path program 5 times [2024-11-14 03:43:03,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:43:03,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371645212] [2024-11-14 03:43:03,204 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-14 03:43:03,205 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 03:43:03,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:43:03,209 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:43:03,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 (12)] Waiting until timeout for monitored process [2024-11-14 03:43:03,345 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-14 03:43:03,345 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:43:03,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 03:43:03,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:43:04,490 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 03:43:04,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:43:04,490 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:43:04,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371645212] [2024-11-14 03:43:04,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371645212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:43:04,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:43:04,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 03:43:04,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243217176] [2024-11-14 03:43:04,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:43:04,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:43:04,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:43:04,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:43:04,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:43:04,492 INFO L87 Difference]: Start difference. First operand 1344 states and 4563 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:43:04,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:43:04,990 INFO L93 Difference]: Finished difference Result 1832 states and 6165 transitions. [2024-11-14 03:43:04,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:43:04,991 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-14 03:43:04,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:43:05,028 INFO L225 Difference]: With dead ends: 1832 [2024-11-14 03:43:05,028 INFO L226 Difference]: Without dead ends: 930 [2024-11-14 03:43:05,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-14 03:43:05,031 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 100 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:43:05,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 232 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:43:05,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2024-11-14 03:43:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2024-11-14 03:43:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 929 states have (on average 3.209903121636168) internal successors, (2982), 929 states have internal predecessors, (2982), 0 states have call successors, (0), 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 03:43:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 2982 transitions. [2024-11-14 03:43:05,091 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 2982 transitions. Word has length 37 [2024-11-14 03:43:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:43:05,092 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 2982 transitions. [2024-11-14 03:43:05,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 03:43:05,092 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 2982 transitions. [2024-11-14 03:43:05,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:43:05,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:43:05,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:43:05,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 (12)] Ended with exit code 0 [2024-11-14 03:43:05,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:43:05,298 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 03:43:05,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:43:05,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1277046931, now seen corresponding path program 6 times [2024-11-14 03:43:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:43:05,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139628559] [2024-11-14 03:43:05,299 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-14 03:43:05,299 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 03:43:05,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:43:05,301 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:43:05,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 (13)] Waiting until timeout for monitored process [2024-11-14 03:43:05,429 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-14 03:43:05,429 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-14 03:43:05,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:43:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:43:05,614 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2024-11-14 03:43:05,614 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:43:05,615 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-14 03:43:05,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-14 03:43:05,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-14 03:43:05,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-14 03:43:05,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-14 03:43:05,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-14 03:43:05,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-14 03:43:05,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-14 03:43:05,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 (13)] Forceful destruction successful, exit code 0 [2024-11-14 03:43:05,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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 03:43:05,823 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2024-11-14 03:43:05,959 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 03:43:05,959 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:43:05,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:43:05 BasicIcfg [2024-11-14 03:43:05,964 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:43:05,965 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:43:05,965 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:43:05,965 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:43:05,966 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:42:40" (3/4) ... [2024-11-14 03:43:05,969 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 03:43:05,970 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:43:05,972 INFO L158 Benchmark]: Toolchain (without parser) took 27834.99ms. Allocated memory was 117.4MB in the beginning and 9.2GB in the end (delta: 9.0GB). Free memory was 92.2MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-14 03:43:05,972 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 117.4MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:43:05,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.53ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 67.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 03:43:05,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.53ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:43:05,973 INFO L158 Benchmark]: Boogie Preprocessor took 34.01ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 63.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:43:05,973 INFO L158 Benchmark]: RCFGBuilder took 1206.78ms. Allocated memory is still 117.4MB. Free memory was 63.5MB in the beginning and 83.4MB in the end (delta: -19.9MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2024-11-14 03:43:05,974 INFO L158 Benchmark]: TraceAbstraction took 25921.32ms. Allocated memory was 117.4MB in the beginning and 9.2GB in the end (delta: 9.0GB). Free memory was 82.8MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-14 03:43:05,974 INFO L158 Benchmark]: Witness Printer took 5.47ms. Allocated memory is still 9.2GB. Free memory was 7.9GB in the beginning and 7.9GB in the end (delta: 199.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:43:05,978 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.49ms. Allocated memory is still 117.4MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 595.53ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 67.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.53ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.01ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 63.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1206.78ms. Allocated memory is still 117.4MB. Free memory was 63.5MB in the beginning and 83.4MB in the end (delta: -19.9MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. * TraceAbstraction took 25921.32ms. Allocated memory was 117.4MB in the beginning and 9.2GB in the end (delta: 9.0GB). Free memory was 82.8MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 5.47ms. Allocated memory is still 9.2GB. Free memory was 7.9GB in the beginning and 7.9GB in the end (delta: 199.7kB). 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=0, t1378=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377=0, t1378=1, t1379=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377=0, t1378=1, t1379=2, t1380=3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L820] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=0, t1378=1, t1379=2, t1380=3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=0, t1378=1, t1379=2, t1380=3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=0, t1378=1, t1379=2, t1380=3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L883] 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}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix051_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - 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: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 851]: 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: 849]: 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: 855]: 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 9 procedures, 85 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 25.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.3s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 949 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 949 mSDsluCounter, 1355 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1014 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1972 IncrementalHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 341 mSDtfsCounter, 1972 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40357occurred in iteration=0, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 506 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 363 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 1500 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1435 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-14 03:43:06,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d1cfa8-b991-4125-89bb-7213a14ef6a8/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